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 A191091 #6 Mar 30 2012 17:23:02
%S A191091 1,2,3,1,2,3,4,2,1,2,3,3,2,3,4,1,3,2,3,2,4,3,4,3,1,4,3,4,2,5,4,2,3,2,
%T A191091 5,1,4,3,6,2,2,4,3,3,2,5,4,3,1,2,5,2,2,3,6,3,3,2,3,4,2,3,4,1,2,3,3,3,
%U A191091 3,3,4,2,4,2,3,4,3,3,4,2,1,4,3,4,2,3,4
%N A191091 Least number of squares required when writing n as a sum of squares with the smallest square as large as possible.
%C A191091 The smallest value in the sum is A191090. All sums have at most 6 terms for n <= 1000. Is this the largest possible value? For n up to 1000, only 39, 55, 143, 543, and 564 need 6 terms.
%H A191091 T. D. Noe, <a href="/A191091/b191091.txt">Table of n, a(n) for n = 1..1000</a>
%e A191091 The sum for 30 gives the first sum having 5 terms: 4 + 4 + 4 + 9 + 9.
%t A191091 Table[s=DeleteCases[#, 0]& /@ PowersRepresentations[n,11,2]; t=Last[Union[First /@ Union /@ s]]; Min @@ Length /@ Select[s, #[[1]] == t &], {n, 100}]
%Y A191091 Cf. A191090, A193018.
%K A191091 nonn
%O A191091 1,2
%A A191091 _T. D. Noe_, Jul 21 2011