|
|
A062530
|
|
Smallest prime p such that there is a gap of 2^n between p and previous prime.
|
|
2
|
|
|
3, 5, 11, 97, 1847, 5623, 89753, 3851587, 1872852203, 1999066711903, 22790428875365903
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
a(2)=11 because 7 and 11 are consecutive primes with difference 4. - Sascha Kurz, Mar 05 2002
The next two terms are <= 13615411331526592827872074749865096844383295034548454421 and 768784577114627305753353689789300110953010089817032096740065409732504678169114467301254783622575120297131239844 respectively. - Larry Reeves (larryr(AT)acm.org), Jun 13 2002
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(PARI) a(n) = {q = 2; p = nextprime(q+1); gap = 2^n; while(p - q != gap, q = p; p = nextprime(p+1)); p; } \\ Michel Marcus, Dec 26 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Further terms from Larry Reeves (larryr(AT)acm.org), Jun 13 2002
|
|
STATUS
|
approved
|
|
|
|