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 A036531 #15 Mar 23 2020 06:33:05 %S A036531 0,64,2744,1481544,4410944,444194947,44474744007,4970444443496, %T A036531 2440744441344,4408846444574424,434424163454644544, %U A036531 40045354844444494784,304443494462464444459,24144094248434404444864,45444444436448021414449,442063442345444443482444864 %N A036531 Smallest cube containing exactly n 4's. %C A036531 a(n)^(1/3) = A048369(n) is the index of the first occurrence of n in sequence A269244. - _M. F. Hasler_, Feb 21 2016 %H A036531 Giovanni Resta, <a href="/A036531/b036531.txt">Table of n, a(n) for n = 0..22</a> %F A036531 a(n) = A048369(n)^3. - _M. F. Hasler_, Feb 21 2016 %t A036531 nsmall = Table[Infinity, 20]; %t A036531 For[i = 0, i <= 10^6, i++, n0 = Count[IntegerDigits[i^3], 4]; %t A036531 If[nsmall[[n0 + 1]] > i^3, nsmall[[n0 + 1]] = i^3]]; %t A036531 Cases[nsmall, _?NumberQ] (* _Robert Price_, Mar 21 2020 *) %Y A036531 Cf. A048369, A036527, A036528, A036529, A036530, A036532, A036533, A036534, A036535, A036536. %K A036531 nonn,base %O A036531 0,2 %A A036531 _David W. Wilson_ %E A036531 Extended with a(0) = 0 by _M. F. Hasler_, Feb 21 2016 %E A036531 a(11)-a(15) from _Giovanni Resta_, Jun 29 2018