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.

A048370 a(n)^3 is smallest cube containing exactly n 5's.

Original entry on oeis.org

5, 25, 136, 715, 1526, 11828, 8121, 115798, 319405, 1771087, 2179693, 11665419, 38160335, 176024528, 1367063798, 3257101805, 9109186828, 38598478444, 136736651535, 380814792667, 821922685008
Offset: 1

Views

Author

Patrick De Geest, Mar 15 1999

Keywords

Crossrefs

Programs

  • Mathematica
    nsmall = Table[Infinity, 15];
    For[i = 0, i <= 10^6, i++, n0 = Count[IntegerDigits[i^3], 5];
      If[nsmall[[n0]] > i, nsmall[[n0]] = i]];
    Cases[nsmall, ?NumberQ] (* _Robert Price, Mar 20 2020 *)

Extensions

a(14) from Michel ten Voorde Jun 13 2003
a(15)-a(20) from Lars Blomberg, Jun 12 2011
a(21) from Giovanni Resta, Jun 29 2018