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.

A036532 Smallest cube containing exactly n 5's.

Original entry on oeis.org

0, 125, 15625, 2515456, 365525875, 3553559576, 1654755935552, 535585155561, 1552755855549592, 32585555653355125, 5555455662315755503, 10355855655959525557, 1587453553555655755059, 55569505975375555595375, 5454055655655586555645952
Offset: 0

Views

Author

Keywords

Comments

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

Crossrefs

Cf. A048370, A036527 - A036536 for other digits 0 - 9.

Programs

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

Formula

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

Extensions

Extended with a(0) = 0 by M. F. Hasler, Feb 21 2016
a(12)-a(14) from Giovanni Resta, Jun 29 2018