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
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