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 A024975 #20 Aug 22 2021 17:22:12
%S A024975 36,73,92,99,134,153,160,190,197,216,225,244,251,281,288,307,342,349,
%T A024975 352,368,371,378,405,408,415,434,469,476,495,521,532,540,547,560,567,
%U A024975 577,584,586,603,623,638,645,664,684,701,729,736,738,755,757,764,792,794,801,820
%N A024975 Sums of three distinct positive cubes.
%C A024975 Subsequence of A003072. Equals A024973 if duplicates of repeated entries are removed. - _R. J. Mathar_, Apr 13 2008
%H A024975 T. D. Noe, <a href="/A024975/b024975.txt">Table of n, a(n) for n = 1..10000</a>
%F A024975 {n: A025469(n) >= 1}. - _R. J. Mathar_, Jun 15 2018
%t A024975 Total/@Subsets[Range[10]^3,{3}]//Union (* _Harvey P. Dale_, Aug 22 2021 *)
%o A024975 (PARI) list(lim)=my(v=List(),x3,t); lim\=1; for(x=3,sqrtnint(lim-9,3), x3=x^3; for(y=2,min(x-1,sqrtnint(lim-x3-1,3)), t=x3+y^3; for(z=1,min(y-1,sqrtnint(lim-t,3)), listput(v,t+z^3)))); Set(v) \\ _Charles R Greathouse IV_, Sep 20 2016
%Y A024975 Cf. A122723 (primes in here), A025399-A025402, A025411 (4 distinct positive cubes).
%K A024975 nonn
%O A024975 1,1
%A A024975 _Clark Kimberling_
%E A024975 Verified by _Don Reble_, Nov 19 2006