OFFSET
2,1
COMMENTS
Estimation involved seems (by experience) strongly improved because floor(prime(n)-log(n)-log(log(n)-3)) > 0 for large enough n.
LINKS
P. Dusart, The kth prime is greater than k(ln k + ln ln k-1) for k>=2, Mathematics of Computation 68 (1999), pp. 411-415.
MATHEMATICA
Table[Floor[Prime[w] - w (Log[w] - Log[Log[w]] - 1)//N], {w, 2, 256}]
PROG
(PARI) a(n) = floor(prime(n) - n*(log(n)-log(log(n))-1)); \\ Michel Marcus, Mar 04 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Sep 17 2003
STATUS
approved