|
Search: id:A070739
|
|
|
| A070739 |
|
Primes of form 2^x+2^y+1. |
|
+0
3
|
|
| 3, 5, 7, 11, 13, 17, 19, 37, 41, 67, 73, 97, 131, 137, 193, 257, 521, 577, 641, 769, 1033, 1153, 2053, 2081, 2113, 4099, 4129, 8209, 12289, 16417, 18433, 32771, 32801, 32833, 40961, 65537, 65539, 133121, 147457, 163841, 262147, 262153, 262657
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
This sequence is the union of A081091 and the Fermat primes, A000215. - T. D. Noe, Jun 22 2007
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
EXAMPLE
|
41=2^5+2^3+1 hence 41 is in the sequence
|
|
MAPLE
|
k := 0:for i from 1 to 140 do for j from i to 140 do if isprime(2^i+2^j+1) then k := k+1:c[k] := 2^i+2^j+1:fi:od:od:sort([3, seq(c[i], i=1..k)]); #gives all terms up to 2^140
|
|
PROGRAM
|
(PARI) for(n=1, 300, if(sum(i=0, n, sum(j=0, i, if(2^i+2^j+1-prime(n), 0, 1)))>0, print1(prime(n), ", ")))
|
|
CROSSREFS
|
Cf. A081091.
Sequence in context: A081092 A030096 A045394 this_sequence A061244 A060290 A096880
Adjacent sequences: A070736 A070737 A070738 this_sequence A070740 A070741 A070742
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 14 2002
|
|
EXTENSIONS
|
More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Aug 15 2002
|
|
|
Search completed in 0.002 seconds
|
