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 A003998 #33 Jan 01 2016 17:29:34
%S A003998 216,217,224,225,540,559,560,567,568,728,729,736,737,756,757,764,793,
%T A003998 801,820,828,854,855,862,863,881,882,889,890,918,919,926,927,945,946,
%U A003998 953,954,980,981,1008,1009,1036,1044,1045,1071,1072,1073,1079,1080
%N A003998 Numbers that are a sum of distinct positive cubes in more than one way.
%H A003998 Zak Seidov and Robert Israel, <a href="/A003998/b003998.txt">Table of n, a(n) for n = 1..10000</a> (n = 1..1038 from Zak Seidov)
%p A003998 F:= proc(x,y) option remember;
%p A003998 if y = 0 then 1
%p A003998 elif y < x^3 then 0
%p A003998 elif y = x^3 then 1
%p A003998 else procname(x+1,y) + procname(x+1,y-x^3)
%p A003998 fi
%p A003998 end proc:
%p A003998 select(t -> F(1,t) > 1, [$1..10000]); # _Robert Israel_, Dec 31 2015
%t A003998 ok[n_] := Length[ Select[ Union[ Union /@ Flatten[ Table[ DeleteCases[ PowersRepresentations[n, k, 3], 0, 2], {k, 1, Floor[(n-1)^(1/3)]}], 1]], Total[#^3] == n & , 2]] == 2; Reap[ Do[ If[ ok[n], Print[n]; Sow[n]], {n, 1, 1100}]][[2, 1]](* _Jean-François Alcover_, Feb 23 2012 *)
%Y A003998 Cf. A001239.
%K A003998 nonn,easy,nice
%O A003998 1,1
%A A003998 _N. J. A. Sloane_
%E A003998 More terms from Larry Reeves (larryr(AT)acm.org), Mar 20 2000