OFFSET
1,1
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, Jan 18 2019
LINKS
John W. Nicholson, Table of n, a(n) for n = 1..80 (terms 1..75 from Jens Kruse Andersen; further terms coming from Thomas R. Nicely site).
Alex Beveridge, Table giving known values of A000101(n), A005250(n), A107578(n)
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:1901.03785 [math.NT], 2019.
Thomas R. Nicely, First occurrence prime gaps
Thomas R. Nicely, First occurrence prime gaps [Local copy, pdf only]
Thomas R. Nicely, Some Results of Computational Research in Prime Numbers [See local copy in A007053]
Matt Visser, Verifying the Firoozbakht, Nicholson, and Farhadian conjectures up to the 81st maximal prime gap, arXiv:1904.00499 [math.NT], 2019.
FORMULA
a(n) = A005669(n)+1. - Jens Kruse Andersen, Oct 19 2010
From John W. Nicholson, Oct 29 2021: (Start)
EXAMPLE
The prime index of a(3) = 5, so prime(a(3)) = prime(5) = 11.
CROSSREFS
KEYWORD
nonn
AUTHOR
Alex Beveridge, Apr 25 2007
EXTENSIONS
Name modified by John W. Nicholson, Nov 19 2013
STATUS
approved