cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A050503 Nearest integer to n*log(n).

Original entry on oeis.org

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
Offset: 1

Views

Author

N. J. A. Sloane, Dec 27 1999

Keywords

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.

Crossrefs

Programs

  • Mathematica
    Table[Round[n Log[n]],{n,100}] (* Harvey P. Dale, Sep 27 2023 *)