OFFSET
1,1
COMMENTS
Alternating Euler quadratic prime generating polynomial.
REFERENCES
Harvey Cohn, Advanced Number Theory,Dover, New York, 1962, page 155.
MATHEMATICA
f[n_] := If[Mod[n, 2] == 1, n^2 + 5*n - 3, n^2 + 5*n + 3] b = Flatten[Table[If[PrimeQ[f[n]] == True, f[n], {}], {n, 1, 100}]]
PROG
(PARI) m=250; for(n=1, m, k=n^2+5*n+3-6*(n%2); if(isprime(k), print1(k, ", ")))
CROSSREFS
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Apr 16 2006
EXTENSIONS
Edited and extended by N. J. A. Sloane, Apr 17 2006
STATUS
approved