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 A059094 #31 Jul 16 2022 11:57:07 %S A059094 1,8,10,17,26,35,44,53,62,71,80,100,107,116,125,134,143,152,161,170, %T A059094 206,215,224,233,242,251,260,305,314,323,332,341,350,404,413,422,431, %U A059094 440,503,512,521,530,602,611,620,701,710,800,999,1000,1007,1016,1025 %N A059094 Numbers whose sum of digits is a cube. %C A059094 The first occurrence of a new cube value in sequence 1, 8, 27, 64, ... occurs at a great distance from each previous value. %C A059094 Consecutive terms differ by 1 iff they are of the form 999..999 and 1000..000 provided the number of 9s is 3*(u^3): that is 999 (length 3) whose digit sum is 27=3^3; 99..99 (length 24) whose digitsum is 216=6^3; 99.999 (length 81) whose digitsum is 729=9^3. - _Carmine Suriano_, Mar 31 2014 %H A059094 Michael De Vlieger, <a href="/A059094/b059094.txt">Table of n, a(n) for n = 1..10000</a> (first 390 terms from Carmine Suriano) %e A059094 999 has digit sum 9 + 9 + 9 = 27 = 3^3, so 999 is a term. %t A059094 Select[Range[1000], IntegerQ@ Power[Total@ IntegerDigits[#], 1/3] &] (* _Michael De Vlieger_, Jul 16 2022 *) %o A059094 (PARI) isok(n) = ispower(sumdigits(n), 3); \\ _Michel Marcus_, Jun 06 2014 %Y A059094 Cf. A007953. %K A059094 easy,nonn,base %O A059094 1,2 %A A059094 _Enoch Haga_, Feb 13 2001