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 A024673 #11 Jan 22 2024 00:03:37 %S A024673 1,2,4,7,11,16,21,28,35,43,52,61,73,84,97,109,124,140,155,173,190,210, %T A024673 228,250,271,292,316,338,365,391,417,444,472,501,531,560,593,626,659, %U A024673 694,728,765,802,842,880,919,960,1001,1045,1086,1131,1176,1222,1268,1313 %N A024673 Position of 1 + n^3 in A024670 (distinct sums of cubes of distinct positive integers). %H A024673 Robert Israel, <a href="/A024673/b024673.txt">Table of n, a(n) for n = 2..10000</a> %p A024673 with(priqueue): %p A024673 initialize(PQ): %p A024673 insert([-9,1,2],PQ): v:= 0: %p A024673 R:= NULL: count:= 0: i:= 0: %p A024673 while count < 100 do %p A024673 t:= extract(PQ); %p A024673 w:= -t[1]; %p A024673 if floor(w) > v then i:= i+1; v:= floor(w) fi; %p A024673 if t[2] = 1 then R:= R, i; count:= count+1 fi; %p A024673 wp:= w + (t[3]+1)^3 - t[3]^3; %p A024673 insert([-wp,t[2],t[3]+1], PQ); %p A024673 if t[3] = t[2]+1 then %p A024673 wp:= t[3]^3 + (t[3]+1)^3 + 1/10; %p A024673 insert([-wp, t[3], t[3]+1],PQ); %p A024673 fi %p A024673 od: %p A024673 R; # _Robert Israel_, Jan 21 2024 %K A024673 nonn %O A024673 2,2 %A A024673 _Clark Kimberling_ %E A024673 Offset corrected by _Sean A. Irvine_, Jul 19 2019