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 A379396 #15 Dec 26 2024 20:05:52 %S A379396 0,1,2,3,4,5,6,7,10,11,12,13,14,15,17,18,19,20,21,22,23,24,25,26,31, %T A379396 38,39,45,46,47,50,52,53 %N A379396 Numbers that can be written in exactly one way as a sum of at most nine positive third powers. %C A379396 The 'nine' is not arbitrary. Waring stated that every natural number can be expressed as a sum of at most nine cubes. (Cf. A002804) %H A379396 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a> %H A379396 Wikipedia, <a href="https://en.wikipedia.org/wiki/Waring%27s_problem">Waring's Problem</a> %H A379396 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a> %e A379396 7 is in the sequence since there is only 1^3+1^3+1^3+1^3+1^3+1^3+1^3. %e A379396 53 is in the sequence since there is only 1^3+1^3+2^3+2^3+2^3+3^3; %o A379396 (PARI) upto(n) = my(v=vector(n), maxb=sqrtnint(n,3)); forvec(x=vector(9,i,[0,maxb]), s=sum(i=1,9,x[i]^3); if(0<s && s<=n, v[s]++); , 1); select(x->x==1,v,1) \\ _David A. Corneth_, Dec 23 2024 %Y A379396 Cf. A002804, A025453, A379397, A379398, A379399, A379400 %K A379396 nonn,more %O A379396 1,3 %A A379396 _Patrick De Geest_, Dec 22 2024