login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A178996
Numbers n such that 5^n mod 2^n is prime.
0
3, 10, 19, 24, 28, 61, 79, 96, 104, 125, 132, 191, 196, 243, 292, 302, 462, 466, 586, 621, 1508, 3307, 3823, 4729, 5370, 6721, 8110, 11145, 13502, 13762, 20266, 27868, 38522, 75470
OFFSET
1,1
COMMENTS
Here 'mod' denotes the binary modulo operation (nonnegative remainder).
MATHEMATICA
fQ[n_] := PrimeQ@ PowerMod[5, n, 2^n]; k = 1; lst = {}; While[k < 17501, If[fQ@ k, AppendTo[lst, k]]; k++]; lst
PROG
(PARI) for(n=1, 9999, ispseudoprime(5^n % 2^n) & print1(n", ")) \\ M. F. Hasler, Jan 03 2011
(PARI) for(n=1, 1e5, if(ispseudoprime(lift(Mod(5, 2^n)^n)), print1(n", "))) \\ Charles R Greathouse IV, Oct 10 2011
CROSSREFS
Cf. A178995.
Sequence in context: A265487 A074893 A074178 * A127852 A064027 A321543
KEYWORD
nonn,hard
AUTHOR
Robert G. Wilson v, Jan 03 2011
EXTENSIONS
a(31)-a(34) from Charles R Greathouse IV, Oct 10 2011
STATUS
approved