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.

A036533 Smallest cube containing exactly n 6's.

Original entry on oeis.org

0, 64, 166375, 46656, 367061696, 1676676672, 66676466375, 2646396666368, 6666963601661, 6946660616126616, 3666676156163166167, 62656677666653866496, 2674826866666660366016, 166465666639716668628669, 3656365366626065666266624, 167947668303666616666566656
Offset: 0

Views

Author

Keywords

Comments

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

Crossrefs

Cf. A048371, A036527 - A036536 for other digits 0 - 9.
Analog for squares: A036510 = A048348^2.

Programs

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

Formula

a(n) = A048371(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