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.

Previous Showing 11-11 of 11 results.

A036528 Smallest cube containing exactly n 1's.

Original entry on oeis.org

0, 1, 1331, 195112, 1191016, 302111711, 1128111921, 1017501115112, 11540111711192, 3110921146111141, 111121611171697125, 13131411119181123391, 1091919111651131183181, 113111518118141111752, 1011911111044153611072111, 101151130119180103111112613
Offset: 0

Views

Author

Keywords

Comments

a(n)^(1/3) = A048366(n) is the index of the first occurrence of n in sequence A269241. - M. F. Hasler, Feb 21 2016

Crossrefs

Programs

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

Formula

a(n) = A048366(n)^3. - M. F. Hasler, Feb 21 2016

Extensions

a(12)-a(15) from Giovanni Resta, Jun 29 2018
Previous Showing 11-11 of 11 results.