|
Search: id:A120937
|
|
|
| A120937 |
|
Least prime such that the distance to the two adjacent primes is 2n or greater. |
|
+0
2
|
|
| 3, 5, 23, 53, 211, 211, 211, 1847, 2179, 2179, 3967, 16033, 16033, 24281, 24281, 24281, 38501, 38501, 38501, 38501, 38501, 58831, 203713, 206699, 206699, 413353, 413353, 413353, 1272749, 1272749, 1272749, 1272749, 2198981, 2198981, 2198981
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Erdos and Suranyi call these reclusive primes and prove that such a prime exists for all n. Except for a(0), the record values are in A023186.
|
|
REFERENCES
|
Paul Erdos and Janos Suranyi, Topics in the theory of numbers, Springer, 2003.
|
|
EXAMPLE
|
a(3)=53 because the adjacent primes 47 and 59 are at distance 6 and all smaller primes have a closer distance.
|
|
MATHEMATICA
|
k=2; Table[While[Prime[k]-Prime[k-1]<2n || Prime[k+1]-Prime[k]<2n, k++ ]; Prime[k], {n, 0, 40}]
|
|
CROSSREFS
|
Sequence in context: A036952 A065720 A148554 this_sequence A075307 A100302 A023247
Adjacent sequences: A120934 A120935 A120936 this_sequence A120938 A120939 A120940
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Jul 21 2006
|
|
|
Search completed in 0.002 seconds
|
