|
Search: id:A066081
|
|
|
| A066081 |
|
a(n) = smallest m such that m+2^j and m-2^j are prime for all 0 < j <= n. |
|
+0
5
|
|
| 5, 9, 15, 50943795, 40874929095, 616517522595975, 93487500801880185, 64606701602327559675
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Is this sequence infinite?
|
|
LINKS
|
Felice Russo, Prime puzzle 167.
Marek Wolf, Conjectures on the gaps between consecutive primes (gzipped postscript).
|
|
EXAMPLE
|
9-4, 9-2, 9+2, 9+4 are prime, but not 5+4 = 7+2, therefore a(2) = 9.
|
|
CROSSREFS
|
Prime quadruples: A014561, sextets: A061671, octets: A066082.
Sequence in context: A023498 A062516 A075133 this_sequence A076856 A099541 A165594
Adjacent sequences: A066078 A066079 A066080 this_sequence A066082 A066083 A066084
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
frank.ellermann(AT)t-online.de, Dec 03 2001
|
|
EXTENSIONS
|
a(5) and a(6) from Don Reble (djr(AT)nk.ca), Dec 07 2001
a(7) from Jim Fougeron (Feb 07) confirmed by Phil Carmody, who also found a(8) (Feb 14 2002).
|
|
|
Search completed in 0.002 seconds
|
