login
A038605
a(n) = floor( prime(n)/n ).
15
2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
OFFSET
1,1
LINKS
FORMULA
The prime number theorem is equivalent to the statement a(n) ~ log n. - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001
MAPLE
seq(floor(ithprime(n)/n), n=1..200); # Robert Israel, Mar 16 2017
CROSSREFS
Cf. A000040.
Sequence in context: A318998 A079951 A095407 * A113121 A109036 A085031
KEYWORD
nonn
AUTHOR
Vasiliy Danilov (danilovv(AT)usa.net) 1998 Jul
EXTENSIONS
Corrected by David Wasserman, Feb 23 2006
STATUS
approved