A038605 - OEIS

This site is supported by donations to The OEIS Foundation.

A038605

Floor( n-th prime/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 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	FORMULA	`The prime number theorem is equivalent to the statement a(n) ~ log n. - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001`
	CROSSREFS	`Cf. A000040.` `Sequence in context: A104360 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 (wasserma(AT)spawar.navy.mil), Feb 23 2006`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 04:02 EST 2012. Contains 205570 sequences.