|
Search: id:A062529
|
|
|
| A062529 |
|
Smallest prime p such that there is a gap of 2^n between p and the next prime. |
|
+0
4
|
|
| 2, 3, 7, 89, 1831, 5591, 89689, 3851459, 1872851947, 1999066711391, 22790428875364879
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(2)=7 because 7 and 11 are consecutive primes with difference 4.
|
|
LINKS
|
C. Hilliard, TwinPrimes Java code.
Thomas R. Nicely, First occurrence prime gaps.
|
|
FORMULA
|
a(n)=A000230[2^(n-1)]. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 12 2007
a(n) = A000230[2^(n-1)] = Min{p|nextprime(p)-p = 2^n} [May need adjusting since offset has been changed]
|
|
EXAMPLE
|
p=89, 89+2^3 = 97, prime
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1}, While[Prime[k + 1] != n + Prime[k], k++ ]; Prime[k]]; Do[ Print[ f[2^n]], {n, 0, 10}] (Robert G. Wilson v, Jan 13 2005)
|
|
CROSSREFS
|
Cf. A000230, A068157, A101232.
Sequence in context: A065002 A053964 A062578 this_sequence A058443 A088120 A111870
Adjacent sequences: A062526 A062527 A062528 this_sequence A062530 A062531 A062532
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jun 25 2001
|
|
EXTENSIONS
|
a(10) sent by Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 13 2005
|
|
|
Search completed in 0.002 seconds
|
