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.

A036536 Smallest cube containing exactly n 9's.

Original entry on oeis.org

0, 729, 29791, 970299, 994011992, 997002999, 499999005953, 999700029999, 999940001199992, 999970000299999, 991023990975990999, 999997000002999999, 299243659909999996099, 999999700000029999999, 929999949497863992829999, 999100239990997599909999
Offset: 0

Views

Author

Keywords

Comments

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

Crossrefs

Cf. A048374, A036527 - A036535 for other digits 0 - 8.
Analog for squares: A036516 = A048354^2.

Programs

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

Formula

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

Extensions

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