The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A038605 a(n) = floor( prime(n)/n ). 13
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 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 Adjacent sequences:  A038602 A038603 A038604 * A038606 A038607 A038608 KEYWORD nonn AUTHOR Vasiliy Danilov (danilovv(AT)usa.net) 1998 Jul EXTENSIONS Corrected by David Wasserman, Feb 23 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 16 21:55 EDT 2021. Contains 345080 sequences. (Running on oeis4.)