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.

Showing 1-1 of 1 results.

A036527 Smallest cube containing exactly n 0's.

Original entry on oeis.org

1, 0, 140608, 1000, 4096000, 140608000, 1000000, 4096000000, 140608000000, 1000000000, 4096000000000, 140608000000000, 1000000000000, 4096000000000000, 140608000000000000, 1000000000000000, 4096000000000000000, 140608000000000000000, 1000000000000000000, 4096000000000000000000, 140608000000000000000000, 1000000000000000000000
Offset: 0

Views

Author

Keywords

Comments

a(n)^(1/3) = A048365(n) is the index of the first occurrence of n in A269250. -- For n = 3k, obviously a(n) = 10^n. The first terms for indices n = 3k+1 and n = 3k+2 equals 4096*10^3k resp. 140608*10^3k. Is there an index from where on this is no longer true? - M. F. Hasler, Feb 20 2016

Crossrefs

Cf. A036528 - A036536 for other digits 1 - 9.
Analog for squares: A036507 = A048345^2.

Programs

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

Formula

a(n) = A048365(n)^3; a(3n) = 10^(3n); a(3n+1) <= 4096*10^(3n) = (16*10^n)^3 for n>0; a(3n+2) <= 140608*10^(3n) = (52*10^n)^3, with equality for all known terms. - M. F. Hasler, Feb 20 2016

Extensions

Extended to a(0) = 1 and three lines of data completed by M. F. Hasler, Feb 20 2016
Showing 1-1 of 1 results.