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.

A067283 Numbers n such that the number of divisors of n is floor(log(n)).

Original entry on oeis.org

11, 13, 17, 19, 25, 49, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, 95, 106, 111, 115, 118, 119, 122, 123, 125, 129, 133, 134, 141, 142, 143, 145, 146, 404, 412, 423, 425, 428, 436, 452, 475, 477, 507, 508, 524, 531, 539, 548, 549, 556, 575, 578
Offset: 1

Views

Author

Benoit Cloitre, Feb 24 2002

Keywords

Crossrefs

Programs

  • Mathematica
    Select[Range[600],DivisorSigma[0,#]==Floor[Log[#]]&] (* Harvey P. Dale, May 07 2018 *)

Formula

n such that A000005(n) = A000195(n).