The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050503 Nearest integer to n*log(n). 4
0, 1, 3, 6, 8, 11, 14, 17, 20, 23, 26, 30, 33, 37, 41, 44, 48, 52, 56, 60, 64, 68, 72, 76, 80, 85, 89, 93, 98, 102, 106, 111, 115, 120, 124, 129, 134, 138, 143, 148, 152, 157, 162, 167, 171, 176, 181, 186, 191, 196, 201, 205, 210, 215, 220, 225, 230, 236, 241 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
The prime number theorem states that the n-th prime is asymptotic to n*log(n).
REFERENCES
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, Theorem 8.
LINKS
MATHEMATICA
Table[Round[n Log[n]], {n, 100}] (* Harvey P. Dale, Sep 27 2023 *)
CROSSREFS
Sequence in context: A087068 A022851 A325946 * A265899 A362882 A265898
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 27 1999
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 19 00:35 EDT 2024. Contains 372666 sequences. (Running on oeis4.)