OFFSET
1,1
COMMENTS
From table in Kontorovich, version 2, 2005, page 7. Abstract: "The prime number theorem gives the following asymptotic for the n-th prime: p_n ~ iL(n), where we are calling iL the inverse to the logarithmic integral function, Li. Let pi(x) denote the number of primes p <= x with p=[iL(n)] for some n. We say that these primes hit the value suggested by the prime number theorem "on the nose". Using exponential sums, the method of stationary phase, and Vaughan-type identities, we show that pi(x) ~ x/log^2(x) and interpret this fact as the independence of the process of the primes to their average value, iL."
For the benefit of anyone trying to track down the history of the sequence, we give references to all four versions of the Kontorovich paper (only one of which gives a list of the terms).
REFERENCES
Alex V. Kontorovich, A Pseudo-Twin Primes Theorem, in "Multiple Dirichlet Series, L-functions and Automorphic Forms", Birkhauser Progress in Math Series, Vol. 300, (2012), 287--298.
LINKS
Alex V. Kontorovich, The Prime Number Theorem on the Nose, arXiv:math/0507569v1.pdf, version 1, 2005, 5 pages.
Alex V. Kontorovich, The Prime Number Theorem on the Nose, arXiv:math/0507569v2.pdf, version 2, 2005, 11 pages. (This is the only version of the paper that gives the sequence explicitly)
Alex V. Kontorovich, A pseduo-twin primes theorem, arXiv:math/0507569v3.pdf, version 3, 2010, 11 pages.
EXAMPLE
a(10) = because for k = 40, which is the 10th such value in the cited table, n = 44, p(k) = 173, iL(n) = 173.094, Li(p(k)) = 43.981, Li(p(k)+1) = 44.175, 1 / log(p(k)) = 0.194.
MATHEMATICA
Li[x_]:=LogIntegral[x]-LogIntegral[2];
Select[Table[Floor@x/.FindRoot[Li[x]==k, {x, Prime@k}], {k, 3, 1000}], PrimeQ] (* Giorgos Kalogeropoulos, Sep 01 2023 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Vos Post, Mar 05 2009
EXTENSIONS
Entry revised by N. J. A. Sloane, Sep 13 2014
More terms by Giorgos Kalogeropoulos, Sep 01 2023
STATUS
approved