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 A036533 #14 Mar 21 2020 16:33:49 %S A036533 0,64,166375,46656,367061696,1676676672,66676466375,2646396666368, %T A036533 6666963601661,6946660616126616,3666676156163166167, %U A036533 62656677666653866496,2674826866666660366016,166465666639716668628669,3656365366626065666266624,167947668303666616666566656 %N A036533 Smallest cube containing exactly n 6's. %C A036533 a(n)^(1/3) = A048371(n) is the index of the first occurrence of n in sequence A269246. - _M. F. Hasler_, Feb 21 2016 %H A036533 Giovanni Resta, <a href="/A036533/b036533.txt">Table of n, a(n) for n = 0..23</a> %F A036533 a(n) = A048371(n)^3. - _M. F. Hasler_, Feb 21 2016 %t A036533 nsmall = Table[Infinity, 20]; %t A036533 For[i = 0, i <= 10^6, i++, n0 = Count[IntegerDigits[i^3], 6]; %t A036533 If[nsmall[[n0 + 1]] > i^3, nsmall[[n0 + 1]] = i^3]]; %t A036533 Cases[nsmall, _?NumberQ] (* _Robert Price_, Mar 21 2020 *) %Y A036533 Cf. A048371, A036527 - A036536 for other digits 0 - 9. %Y A036533 Analog for squares: A036510 = A048348^2. %K A036533 nonn,base %O A036533 0,2 %A A036533 _David W. Wilson_ %E A036533 Extended with a(0) = 0 by _M. F. Hasler_, Feb 21 2016 %E A036533 a(11)-a(15) from _Giovanni Resta_, Jun 29 2018