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.

A034884 Numbers k such that k < d(k)^2, where d(k) = A000005(k).

Original entry on oeis.org

2, 3, 4, 6, 8, 10, 12, 14, 15, 16, 18, 20, 24, 28, 30, 32, 36, 40, 42, 48, 54, 56, 60, 72, 80, 84, 90, 96, 108, 120, 126, 132, 140, 144, 168, 180, 192, 210, 216, 240, 252, 288, 300, 336, 360, 420, 480, 504, 540, 720, 840, 1260
Offset: 1

Views

Author

Keywords

Comments

See comment in A175495. - Vladimir Shevelev, May 07 2013
The deficient terms are 2, 3, 4, 8, 10, 14, 15, 16, 32; the first perfect or abundant number not listed is 66 = 2 * 3 * 11; the only term not 7-smooth is 132 = 2^2 * 3 * 11; the largest not divisible by 6 is 140 = 2^2 * 5 * 7. - Peter Munn, Sep 19 2021
The union of this sequence and A276734 has 74 total terms which are all k with floor(sqrt(k)) <= d(k). - Bill McEachen, Apr 07 2023

Crossrefs

Programs

  • Mathematica
    Select[Range[1300],#Harvey P. Dale, Apr 11 2014 *)
  • PARI
    isok(n) = (n < numdiv(n)^2) \\ Michel Marcus, Jun 07 2013

Extensions

Labos Elemer added the last three terms and observes that this sequence is now complete.