OFFSET
1,2
REFERENCES
H. Riesel, "Prime numbers and computer methods for factorization", Progress in Mathematics, Vol. 57, Birkhauser, Boston, 1985, Chap. 4, see pp. 381-384.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Ray Ballinger, Proth Search Page
R. M. Robinson, A report on primes of the form k.2^n+1 and on factors of Fermat numbers, Proc. Amer. Math. Soc., 9 (1958), 673-681.
MATHEMATICA
Select[Range[0, 4000], PrimeQ[(25 4^# + 1)] &] (* Vincenzo Librandi, Sep 07 2012 *)
PROG
(Magma) [n: n in [0..3000] | IsPrime(25*4^n + 1)]; // Vincenzo Librandi, Sep 07 2012
(PARI) is(n)=ispseudoprime(25*4^n+1) \\ Charles R Greathouse IV, Jun 13 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(25) from Vincenzo Librandi, Sep 07 2012
STATUS
approved