OFFSET
1,2
REFERENCES
H. Riesel, Prime numbers and computer methods for factorization, in 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.
C. K. Caldwell, The Prime Pages.
R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712. [Annotated scanned copy]
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.
PROG
(PARI) is(n)=ispseudoprime(7*4^n+1) \\ Charles R Greathouse IV, Jun 06 2017
CROSSREFS
KEYWORD
hard,nonn
AUTHOR
EXTENSIONS
More terms (from A032353) added by Joerg Arndt, Apr 07 2013
STATUS
approved