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.

A036535 Smallest cube containing exactly n 8's.

Original entry on oeis.org

0, 8, 74088, 778688, 82881856, 835896888, 13858588808, 4862885368888, 148388768680888, 18861880880549888, 8228852188683588288, 28918668584888698888, 2888985884683248888875, 88474488708885888872808, 8889858696418898888882863, 8808698038888853888858648
Offset: 0

Views

Author

Keywords

Comments

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

Crossrefs

Cf. A048373, A036527 - A036536 for other digits 0 - 9.
Analog for squares: A036515 = A048353^2.

Programs

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

Formula

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

Extensions

Extended with a(0) = 0 by M. F. Hasler, Feb 21 2016
a(11)-a(15) from Giovanni Resta, Jun 29 2018
Previous Showing 11-11 of 11 results.