This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A048365 a(n)^3 is smallest cube containing exactly n 0's. 20
 1, 0, 52, 10, 160, 520, 100, 1600, 5200, 1000, 16000, 52000, 10000, 160000, 520000, 100000, 1600000, 5200000, 1000000, 16000000, 52000000, 10000000, 160000000, 520000000, 100000000, 1600000000, 5200000000, 1000000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n) is the index of the first occurrence of n in A269250.-- Is there an index n = 3k+1 or n = 3k+2 from which on the pattern a(3k+1) = 16*10^k resp. a(3k+2) = 52*10^k is no longer true? - M. F. Hasler, Feb 20 2016 LINKS Eric Weisstein's World of Mathematics, Cubic Number FORMULA a(3k) = 10^k; a(3k+1) <= 16*10^k (k>0), a(3k+2) <= 52*10^k. - M. F. Hasler, Feb 20 2016 MATHEMATICA nsmall = Table[Infinity, 12]; For[i = 0, i <= 52000, i++, n0 = Count[IntegerDigits[i^3], 0];   If[nsmall[[n0]] > i, nsmall[[ n0]] = i]]; Join[{1}, nsmall]  (* Robert Price, Sep 26 2018 *) CROSSREFS Cf. A036527, A269250. Sequence in context: A275412 A100990 A298573 * A317416 A033372 A126767 Adjacent sequences:  A048362 A048363 A048364 * A048366 A048367 A048368 KEYWORD nonn,base,more AUTHOR Patrick De Geest, Mar 15 1999 EXTENSIONS a(19)-a(27) from Lars Blomberg, Jun 12 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 22 16:41 EDT 2019. Contains 327311 sequences. (Running on oeis4.)