|
| |
|
|
A050499
|
|
Nearest integer to n/ln(n).
|
|
10
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,1
|
|
|
COMMENTS
| 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)=n*log(e)/log(n)=n*A002285/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.
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=2..10000
|
|
|
CROSSREFS
| Cf. A000720, A050500, A050501.
Sequence in context: A111233 A105159 A176873 * A147752 A114227 A187469
Adjacent sequences: A050496 A050497 A050498 * A050500 A050501 A050502
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Dec 27 1999
|
| |
|
|
