OFFSET
1,2
COMMENTS
Conjecture: log a(n) ~ n/2. That is, record prime gaps occur about twice as often as records in an i.i.d. random sequence of comparable length (see arXiv:1709.05508 for a heuristic explanation). - Alexei Kourbatov, Mar 28 2018
REFERENCES
H. Riesel, Prime numbers and computer methods for factorization, Progress in Mathematics, Vol. 57, Birkhäuser, Boston, 1985, Chap. 4, see pp. 381-384.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
John W. Nicholson, Table of n, a(n) for n = 1..82 (first 77 terms from Charles R Greathouse IV)
Jens Kruse Andersen, The Top-20 Prime Gaps.
Jens Kruse Andersen, New record prime gap.
Jens Kruse Andersen, Maximal gaps.
Vincent Granville, Piercing Gilbreath's Conjecture: From Deep Number Theory Insights to Fintech and Cybersecurity, arXiv:2607.04166 [cs.CR], 2026. See p. 20 (Table 19).
Richard K. Guy, Letter to N. J. A. Sloane, 1987.
Alexei Kourbatov, Tables of record gaps between prime constellations, arXiv preprint arXiv:1309.4053 [math.NT], 2013.
Alexei Kourbatov, On the nth record gap between primes in an arithmetic progression, arXiv:1709.05508 [math.NT], 2017; Int. Math. Forum, 13 (2018), 65-78.
Alexei Kourbatov and Marek Wolf, Predicting maximal gaps in sets of primes, arXiv preprint arXiv:1901.03785 [math.NT], 2019.
Thomas R. Nicely, First occurrence prime gaps. [For local copy see A000101]
Matt Visser, Verifying the Firoozbakht, Nicholson, and Farhadian conjectures up to the 81st maximal prime gap, arXiv:1904.00499 [math.NT], 2019.
Robert G. Wilson v, Notes (no date).
Jeff Young and Aaron Potler, First occurrence prime gaps, Math. Comp. 52 (1989), 221-224.
FORMULA
a(n) = A107578(n) - 1. - Jens Kruse Andersen, Oct 19 2010
MATHEMATICA
f[n_] := Block[{d, i, m = 0}, Reap@ For[i = 1, i <= n, i++, d = Prime[i + 1] - Prime@ i; If[d > m, m = d; Sow@ i, False]] // Flatten // Rest]; f@ 1000000 (* Michael De Vlieger, Mar 24 2015 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved
