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.

A048366 a(n)^3 is smallest cube containing exactly n 1's.

Original entry on oeis.org

1, 11, 58, 106, 671, 1041, 10058, 22598, 145981, 480765, 2359231, 10297461, 4836178, 100395471, 465933117, 481182258, 4810215701, 16886336471, 49303833471, 103791158471, 223818432208, 4643311948655, 4809689791471
Offset: 1

Views

Author

Patrick De Geest, Mar 15 1999

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Module[{i}, i = 1; While[DigitCount[i^3][[1]] != n, i++;]; i]; (* Sam Handler (sam_5_5_5_0(AT)yahoo.com), Aug 23 2006 *)

Extensions

a(14) from Sam Handler (sam_5_5_5_0(AT)yahoo.com), Aug 23 2006
a(15)-a(20) from Lars Blomberg, Jun 12 2011
a(21)-a(23) from Giovanni Resta, Jun 29 2018