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 A024981 #49 Aug 28 2024 04:21:03
%S A024981 3,10,17,24,29,36,43,55,62,66,73,80,81,92,99,118,127,129,134,136,141,
%T A024981 153,155,160,179,190,192,197,216,218,225,232,244,251,251,253,258,270,
%U A024981 277,281,288,307,314,342,344,345,349,352,359,368,371,375,378,397,405,408,415,433
%N A024981 Numbers that are the sum of 3 positive cubes, including repetitions.
%D A024981 H. Davenport, Sums of three positive cubes, J. London Math. Soc., 25 (1950), 339-343. Coll. Works III p. 999.
%H A024981 Bruno Berselli, <a href="/A024981/b024981.txt">Table of n, a(n) for n = 1..2000</a>
%H A024981 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%e A024981 An example of repetition: 251 shows twice, because 251 = 1^3+5^3+5^3 = 2^3+3^3+6^3. [_Jean-François Alcover_, Jul 31 2013]
%t A024981 m = 8; Sort[Select[Flatten[Table[x^3 + y^3 + z^3, {x, 1, m}, {y, x, m}, {z, y, m}]], # <= m^3 + 2 &]] (* _T. D. Noe_, Jul 30 2013 *)
%t A024981 max = 500; pr = Table[ PowersRepresentations[n, 3, 3], {n, 1, max}] // Flatten[#, 1]& // Select[#, Times @@ # != 0 &]&; Total[#^3] & /@ pr (* _Jean-François Alcover_, Jul 31 2013 - replaced my previous incorrect code *)
%Y A024981 Cf. A003072, A003325.
%K A024981 nonn,easy,nice
%O A024981 1,1
%A A024981 _Clark Kimberling_
%E A024981 Corrected by _David W. Wilson_, May 15 1997
%E A024981 Inserted a second 251 from _T. D. Noe_, Jul 30 2013