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.
%I A036535 #12 Mar 21 2020 16:34:02 %S A036535 0,8,74088,778688,82881856,835896888,13858588808,4862885368888, %T A036535 148388768680888,18861880880549888,8228852188683588288, %U A036535 28918668584888698888,2888985884683248888875,88474488708885888872808,8889858696418898888882863,8808698038888853888858648 %N A036535 Smallest cube containing exactly n 8's. %C A036535 a(n)^(1/3) = A048373(n) is the index of the first occurrence of n in sequence A269248. - _M. F. Hasler_, Feb 21 2016 %H A036535 Giovanni Resta, <a href="/A036535/b036535.txt">Table of n, a(n) for n = 0..22</a> %F A036535 a(n) = A048373(n)^3. - _M. F. Hasler_, Feb 21 2016 %t A036535 nsmall = Table[Infinity, 20]; %t A036535 For[i = 0, i <= 10^6, i++, n0 = Count[IntegerDigits[i^3], 8]; %t A036535 If[nsmall[[n0 + 1]] > i^3, nsmall[[n0 + 1]] = i^3]]; %t A036535 Cases[nsmall, _?NumberQ] (* _Robert Price_, Mar 21 2020 *) %Y A036535 Cf. A048373, A036527 - A036536 for other digits 0 - 9. %Y A036535 Analog for squares: A036515 = A048353^2. %K A036535 nonn,base %O A036535 0,2 %A A036535 _David W. Wilson_ %E A036535 Extended with a(0) = 0 by _M. F. Hasler_, Feb 21 2016 %E A036535 a(11)-a(15) from _Giovanni Resta_, Jun 29 2018