A038605 a(n) = floor( prime(n)/n ).

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

Author

Vasiliy Danilov (danilovv(AT)usa.net) 1998 Jul

Keywords

• nonn

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A000040.

Programs

Maple

seq(floor(ithprime(n)/n), n=1..200); # Robert Israel, Mar 16 2017

Formula

The prime number theorem is equivalent to the statement a(n) ~ log n. - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001

Extensions

Corrected by David Wasserman, Feb 23 2006