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.

A048369 a(n)^3 is smallest cube containing exactly n 4's.

Original entry on oeis.org

4, 14, 114, 164, 763, 3543, 17066, 13464, 163974, 757364, 3421244, 6727219, 28902604, 35685649, 761777604, 1350780517, 2543012249, 7633715304, 101476238101, 163186746514, 353823251814, 5708006133707
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], 4];
      If[nsmall[[n0]] > i, nsmall[[n0]] = i]];
    Cases[nsmall, ?NumberQ] (* _Robert Price, Mar 20 2020 *)

Extensions

a(15)-a(20) from Lars Blomberg, Jun 12 2011
a(21) from Giovanni Resta, Jun 29 2018
a(22) from Giovanni Resta, Mar 23 2020