|
Search: id:A000101
|
|
|
| A000101 |
|
Increasing gaps between primes (upper end) (compare A002386, which gives lower ends of these gaps).
(Formerly M2485 N0984)
|
|
+0
16
|
|
| 3, 5, 11, 29, 97, 127, 541, 907, 1151, 1361, 9587, 15727, 19661, 31469, 156007, 360749, 370373, 492227, 1349651, 1357333, 2010881, 4652507, 17051887, 20831533, 47326913, 122164969, 189695893, 191913031, 387096383, 436273291, 1294268779
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
B. C. Berndt, Ramanujan's Notebooks Part IV, Springer-Verlag, see p. 133.
D. Shanks, On maximal gaps between successive primes, Math. Comp., 18 (1964), 646-651.
J. Young and A. Potler, First occurrence prime gaps, Math. Comp., 52 (1989), 221-224.
|
|
LINKS
|
Alex Beveridge and M. F. Hasler, Table of n, a(n) for n = 1..74
Alex Beveridge, Table giving known values of A000101(n), A005250(n), A107578(n)
Andrew Booker, The Nth Prime Page
Thomas R. Nicely, Home Page
Tomas Oliveira e Silva, Computational projects
Index entries for primes, gaps between
|
|
FORMULA
|
a(n)=A002386(n)+A005250(n)=A008995(n-1)+1 - M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Dec 13 2007
|
|
PROGRAM
|
(PARI) p=q=2; g=0; until( g<(q=nextprime(1+p=q))-p & print1(p+g=q-p, ", "), ) \\ - M. F. Hasler, Dec 13 2007
|
|
CROSSREFS
|
Cf. A002386 (lower ends), A005250 (record gaps), A107578.
Cf. A005669, A111943.
Sequence in context: A080443 A057735 A095302 this_sequence A037152 A084748 A146243
Adjacent sequences: A000098 A000099 A000100 this_sequence A000102 A000103 A000104
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
See A002386 for complete list of known terms and further references.
|
|
|
Search completed in 0.002 seconds
|
