OFFSET
1,1
COMMENTS
The prime n in this sequence are in A000043, which produce the Mersenne primes. If 2p is in this sequence, with p prime, then p is a Wagstaff number, A000978. - T. D. Noe, Apr 02 2008
While the sequence looks quite dense for small values, note that there are only 10 values in the interval [700,1200]. - M. F. Hasler, Apr 03 2008
No term greater than 12 can be congruent to 4 modulo 8 as proved by Schinzel (1962), see also Pomerance (2024). Note the Aurifeuillean factorization: Product_{4|d, d|8*k+4} Phi(d,2) = 2^(4k+2) + 1 = (2^(2k+1) - 2^(k+1) + 1) * (2^(2k+1) + 2^(k+1) + 1). If Phi(8*k+4,2) is prime, then it divides either 2^(2k+1) - 2^(k+1) + 1 or 2^(2k+1) + 2^(k+1) + 1. This immediately proves that no term can be of the form 4*p for odd primes p >= 5 Since Phi(4*p,2) = (2^(2*p) + 1)/5. - Jianing Song, Apr 04 2022; edited by Max Alekseyev, Dec 03 2024
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..289 (terms 1..234, 235..277, and 278..289 from Yves Gallot, T. D. Noe, and Carl Pomerance, respectively)
Joerg Arndt, Matters Computational (The Fxtbook)
Yves Gallot, Cyclotomic polynomials and prime numbers
Carl Pomerance, Cyclotomic primes, arXiv:2411.04213 [math.NT], 2024.
Wikipedia, Aurifeuillean factorization
MATHEMATICA
Select[Range[600], PrimeQ[Cyclotomic[ #, 2]]&]
PROG
(PARI) for( i=1, 999, ispseudoprime( polcyclo(i, 2)) && print1( i", ")) /* for PARI < 2.4.2 use ...subst(polcyclo(i), x, 2)... */ \\ M. F. Hasler, Apr 03 2008
CROSSREFS
KEYWORD
nonn
AUTHOR
Reiner Martin, Jul 04 2002
EXTENSIONS
Edited by Max Alekseyev, Apr 25 2018
STATUS
approved