The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A364186 Primes p such that p divides 2^((p-1)/x) - 1, where x is the smallest odd prime factor of p - 1. 0
31, 43, 109, 127, 157, 223, 229, 251, 277, 283, 307, 397, 431, 433, 439, 457, 499, 601, 641, 643, 691, 727, 733, 739, 811, 911, 919, 953, 971, 997, 1013, 1021, 1051, 1069, 1093, 1103, 1163, 1181, 1327, 1399, 1423, 1459, 1471, 1579, 1597, 1627, 1657, 1699, 1709 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
REFERENCES
Allan Cunningham, Haupt-exponents of 2, The Quarterly Journal of Pure and Applied Mathematics, Vol. 37 (1906), pp. 122-145.
LINKS
PROG
(Magma) [p: p in PrimesUpTo(1709) | #Factorization(p-1) ge 2 and Modexp(2, Truncate((p-1)/Factorization(p-1)[2][1]), p) eq 1];
(PARI) forprime(p=2, 1709, v=Vec(factor(p-1))[1]; if(#v>1, t=0; e=v[2]; x=floor(p^(1/e))+1; until(x==p||t==2, if(Mod(x, p)^e==2, t++); x++); if(t==2, print1(p, ", "))));
(PARI) isok(p) = my(v=Vec(factor(p-1))[1]); isprime(p) && #v>1 && Mod(2, p)^((p-1)/v[2])==1;
CROSSREFS
Supersequence of A014752.
Sequence in context: A307950 A342974 A347035 * A059898 A016108 A014752
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 05:56 EDT 2024. Contains 372549 sequences. (Running on oeis4.)