id:A050499 - OEIS Search Results

Search: id:A050499

Displaying 1-1 of 1 results found.

page 1

Nearest integer to n/ln(n).

+0
8

3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17 (list; graph; listen)

	OFFSET	`2,1`
	COMMENT	`The prime number theorem states that the number of primes <= x is asymptotic to x/ln(x).` `n/ln(n)=n/log(n) * 1/ln(10)=nlog(e)/log(n)=nA002285/log(n) [From Eric Desbiaux (moongerms(AT)wanadoo.fr), Jun 27 2009]`
	REFERENCES	`Cf. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, Theorem 6.`
	CROSSREFS	`Cf. A000720, A050500, A050501.` `Sequence in context: A081168 A111233 A105159 this_sequence A147752 A114227 A112593` `Adjacent sequences: A050496 A050497 A050498 this_sequence A050500 A050501 A050502`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Dec 27 1999`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research