id:A038605 - OEIS Search Results

Search: id:A038605

Displaying 1-1 of 1 results found.

page 1

Floor( n-th prime/n ).

+0
10

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; listen)

	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.` `Adjacent sequences: A038602 A038603 A038604 this_sequence A038606 A038607 A038608` `Sequence in context: A104360 A079951 A095407 this_sequence A113121 A109036 A085031`
	KEYWORD	`nonn`
	AUTHOR	`Vasiliy Danilov (danilovv(AT)usa.net) 1998 Jul`
	EXTENSIONS	`Corrected by David Wasserman (wasserma(AT)spawar.navy.mil), Feb 23 2006`

page 1

Search completed in 0.003 seconds

Last modified November 8 07:45 EST 2009. Contains 166143 sequences.

AT&T Labs Research