|
| |
|
|
A156982
|
|
Numbers n such that 2^n+29 is prime.
|
|
0
| |
|
|
1, 3, 5, 7, 9, 13, 15, 17, 23, 27, 33, 37, 43, 63, 69, 73, 79, 89, 117, 127, 239, 395, 409, 465, 837, 2543
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| n can't be of the form 4m+2 or 4m because 2^(2m+2) + 29 is divisible by 3 and 2^4m + 29 is divisible by 15 [From Avik Roy (avik_3.1416(AT)yahoo.co.in), Feb 21 2009]
|
|
|
EXAMPLE
| For n = 1 2^1 + 29 = 31
For n = 3 2^3 + 29 = 37
|
|
|
MATHEMATICA
| Delete[Union[Table[If[PrimeQ[2^n + 29], n, 0], {n, 1, 2600}]], 1]
|
|
|
CROSSREFS
| A019434 Fermat Primes 2^(2^n)+1 A057732 (2^n+3) A059242 (2^n+5) A057195 (2^n+7) A102633 (2^n+11)
Sequence in context: A131437 A003553 A003532 * A157048 A190857 A003543
Adjacent sequences: A156979 A156980 A156981 * A156983 A156984 A156985
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Edwin Dyke (ed.dyke(AT)btinternet.com), Feb 20 2009
|
| |
|
|
