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 A054402 #17 May 15 2015 11:11:38
%S A054402 17,65,89,108,129,145,225,233,252,297,316,388,449,464,505,537,548,577,
%T A054402 593,633,730,737,745,792,793,801,873,1025,1088,1090,1116,1289,1304,
%U A054402 1305,1367,1412,1441,1452,1529,1585,1601
%N A054402 Numbers that are the sum of a positive square and a positive cube in more than one way.
%H A054402 Charles R Greathouse IV, <a href="/A054402/b054402.txt">Table of n, a(n) for n = 1..10000</a>
%e A054402 a(1)=17 since 17 = 3^2 + 2^3 = 4^2 + 1^3.
%t A054402 lst={};Do[Do[AppendTo[lst,n^2+m^3],{n,5!}],{m,5!}];lst=Sort[lst]; lst2={};Do[If[lst[[n]]==lst[[n+1]],AppendTo[lst2,lst[[n]]]],{n,Length[lst]-1}];lst2; Take[Union[lst2],123] (* _Vladimir Joseph Stephan Orlovsky_, Jul 17 2009 *)
%o A054402 (PARI) list(lim)=my(v=List(),u=List());for(n=1,sqrtint(lim\1-1), for(m=1, sqrtnint(lim\1-n^2,3), listput(v,n^2+m^3))); v=vecsort(v); for(i=2,#v, if(v[i]==v[i-1], listput(u,v[i]))); Set(u) \\ _Charles R Greathouse IV_, May 15 2015
%Y A054402 Cf. A055393, A055394.
%K A054402 easy,nonn
%O A054402 1,1
%A A054402 _Henry Bottomley_, May 12 2000