OFFSET
1,1
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
C. R. Zarnke and H. C. Williams, Computer determination of some large primes, pp. 563-570 in Proceedings of the Louisiana Conference on Combinatorics, Graph Theory and Computer Science. Vol. 2, edited R. C. Mullin et al., 1971.
MATHEMATICA
Do[m = n; If[PrimeQ[2*25^n - 1], Print[n]], {n, 1, 10^3}]
Select[Range[0, 5000], PrimeQ[(2*25^# - 1)] &] (* Vincenzo Librandi, Sep 25 2012 *)
PROG
(PARI) is(n)=ispseudoprime(2*25^n-1) \\ Charles R Greathouse IV, Jun 13 2017
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
EXTENSIONS
a(10) from Robert G. Wilson v, Nov 02 2000
a(11)-a(13) from Vincenzo Librandi, Sep 25 2012
a(14)-a(17) (from A120375) from Joerg Arndt, Jun 15 2020
a(18) (from A120375) by Jorge Coveiro, Jun 20 2020
STATUS
approved