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 A036528 #14 Mar 20 2020 23:32:32 %S A036528 0,1,1331,195112,1191016,302111711,1128111921,1017501115112, %T A036528 11540111711192,3110921146111141,111121611171697125, %U A036528 13131411119181123391,1091919111651131183181,113111518118141111752,1011911111044153611072111,101151130119180103111112613 %N A036528 Smallest cube containing exactly n 1's. %C A036528 a(n)^(1/3) = A048366(n) is the index of the first occurrence of n in sequence A269241. - _M. F. Hasler_, Feb 21 2016 %H A036528 Giovanni Resta, <a href="/A036528/b036528.txt">Table of n, a(n) for n = 0..23</a> %F A036528 a(n) = A048366(n)^3. - _M. F. Hasler_, Feb 21 2016 %t A036528 nsmall = Table[Infinity, 20]; %t A036528 For[i = 0, i <= 10^6, i++, n0 = Count[IntegerDigits[i^3], 1]; %t A036528 If[nsmall[[n0 + 1]] > i^3, nsmall[[n0 + 1]] = i^3]]; %t A036528 Cases[nsmall, _?NumberQ] (* _Robert Price_, Mar 20 2020 *) %Y A036528 Cf. A048366, A036527, A036529, A036530, A036531, A036532, A036533, A036534, A036535, A036536. %K A036528 nonn,base %O A036528 0,3 %A A036528 _David W. Wilson_ %E A036528 a(12)-a(15) from _Giovanni Resta_, Jun 29 2018