|
| |
|
|
A159260
|
|
Numbers n such that 1 + sum_{i=1..n} 2^prime[i] is prime.
|
|
1
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| See A159261 for the primes produced by these n. See A159262 for prime(n), the largest exponent in the sum. The term 1903 produces a probable prime; smaller n produce provable primes. See A122035 for the reducibility of the polynomial obtained by replacing 2 by x.
|
|
|
EXAMPLE
| 1 is here because 1 + 2^2 = 5 is prime.
2 is here because 1 + 2^2 + 2^3 = 13 is prime.
4 is here because 1 + 2^2 + 2^3 + 2^5 + 2^7 = 173 is prime.
5 is here because 1 + 2^2 + 2^3 + 2^5 + 2^7 + 2^11 = 2111 is prime.
|
|
|
MATHEMATICA
| s=1; Reap[Do[s=s+2^Prime[n]; If[PrimeQ[s], Sow[n]], {n, 2000}]][[2, 1]]
|
|
|
CROSSREFS
| Sequence in context: A171411 A092752 A152603 * A013103 A012973 A013154
Adjacent sequences: A159257 A159258 A159259 * A159261 A159262 A159263
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| T. D. Noe (noe(AT)sspectra.com), Apr 07 2009
|
| |
|
|
