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.

A048365 a(n)^3 is smallest cube containing exactly n 0's.

This page as a plain text file.
%I A048365 #22 Feb 16 2025 08:32:39
%S A048365 1,0,52,10,160,520,100,1600,5200,1000,16000,52000,10000,160000,520000,
%T A048365 100000,1600000,5200000,1000000,16000000,52000000,10000000,160000000,
%U A048365 520000000,100000000,1600000000,5200000000,1000000000
%N A048365 a(n)^3 is smallest cube containing exactly n 0's.
%C A048365 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
%H A048365 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CubicNumber.html">Cubic Number</a>
%F A048365 a(3k) = 10^k; a(3k+1) <= 16*10^k (k>0), a(3k+2) <= 52*10^k. - _M. F. Hasler_, Feb 20 2016
%t A048365 nsmall = Table[Infinity, 12];
%t A048365 For[i = 0, i <= 52000, i++, n0 = Count[IntegerDigits[i^3], 0];
%t A048365   If[nsmall[[n0]] > i, nsmall[[ n0]] = i]];
%t A048365 Join[{1}, nsmall]  (* _Robert Price_, Sep 26 2018 *)
%Y A048365 Cf. A036527, A269250.
%K A048365 nonn,base,more
%O A048365 0,3
%A A048365 _Patrick De Geest_, Mar 15 1999
%E A048365 a(19)-a(27) from _Lars Blomberg_, Jun 12 2011