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.

A050501 a(n) = ceiling(n/log(n)).

Original entry on oeis.org

3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18
Offset: 2

Views

Author

N. J. A. Sloane, Dec 27 1999

Keywords

Comments

Also, least k such that k*log(n) exceeds n. - Amarnath Murthy, Jun 17 2004

Crossrefs

See A050499 for more information.

Programs

  • Mathematica
    Do[k = 1; While[k*Log[n] <= n, k++ ]; Print[k], {n, 2, 100}] (* Ryan Propper, Sep 17 2005 *)
    Array[ Ceiling[#/Log@#] &, 80, 2] (* Robert G. Wilson v, Jan 15 2017 *)

Extensions

Edited by N. J. A. Sloane, Sep 15 2008 at the suggestion of R. J. Mathar