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 A036529 #18 Mar 27 2020 05:37:22 %S A036529 0,27,21952,2628072,202262003,229220928,22521332224,21148222722264, %T A036529 25942222239227,2272271222935232,2262268226562252992, %U A036529 4223937222222326272,22225347273222227224,122245292222422449622424,2732072222242422541222208,22422524292920620222272827 %N A036529 Smallest cube containing exactly n 2's. %C A036529 a(n)^(1/3) = A048367(n) is the index of the first occurrence of n in sequence A269242. - _M. F. Hasler_, Feb 21 2016 %H A036529 Giovanni Resta, <a href="/A036529/b036529.txt">Table of n, a(n) for n = 0..23</a> %F A036529 a(n) = A048367(n)^3. - _M. F. Hasler_, Feb 21 2016 %t A036529 nsmall = Table[Infinity, 20]; %t A036529 For[i = 0, i <= 10^6, i++, n0 = Count[IntegerDigits[i^3], 2]; %t A036529 If[nsmall[[n0 + 1]] > i^3, nsmall[[n0 + 1]] = i^3]]; %t A036529 Cases[nsmall, _?NumberQ] (* _Robert Price_, Mar 20 2020 *) %Y A036529 Cf. A048367, A036527, A036528, A036530, A036531, A036532, A036533, A036534, A036535, A036536. %K A036529 nonn,base %O A036529 0,2 %A A036529 _David W. Wilson_ %E A036529 a(12)-a(15) from _Giovanni Resta_, Jun 29 2018