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 A096021 #3 Mar 30 2012 17:22:33
%S A096021 1507,4323,5947,10707,19723,30067,34483,47107,58843,77683,111763,
%T A096021 106723,126043,166147,164803,222643,217627,232243,289963,319243,
%U A096021 300787,319867,462883,393187,546067,532123,502483,615883,662803,606643
%N A096021 Greatest number, not divisible by 4, having exactly n partitions into three distinct positive squares.
%C A096021 These are conjectured values. The Mathematica program checks numbers up to 10^6.
%t A096021 lim=1000; nLst=Table[0, {lim^2}]; Do[n=a^2+b^2+c^2; If[n>0 && n<lim^2, nLst[[n]]++ ], {a, lim}, {b, a+1, Sqrt[lim^2-a^2]}, {c, b+1, Sqrt[lim^2-a^2-b^2]}]; Table[Last[Select[Flatten[Position[nLst, k]], Mod[ #, 4]>0&]], {k, 30}]
%Y A096021 Cf. A025415 (least sum of 3 distinct nonzero squares in exactly n ways).
%K A096021 nonn
%O A096021 1,1
%A A096021 _T. D. Noe_, Jun 15 2004