OFFSET
1,1
COMMENTS
A strong form of Bertrand's postulate (Chebyshev's theorem) says there exists a prime number p with n < p < 2*n - 2 if n > 3.
The first prime > 3 is 5, so the sequence begins a(1) = 5.
For references, links, and crossrefs, see A006992 (Bertrand primes I).
EXAMPLE
MATHEMATICA
NestList[NextPrime[2 # - 2, -1] &, 5, 40]
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Sondow, Jul 30 2013
STATUS
approved