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 A191090 #13 Dec 12 2015 15:50:44
%S A191090 1,1,1,2,1,1,1,2,3,1,1,2,2,1,1,4,2,3,1,2,2,2,1,2,5,2,3,2,2,2,2,4,2,3,
%T A191090 2,6,2,2,2,2,4,2,3,2,3,2,2,4,7,5,2,4,2,3,2,2,4,3,3,2,5,2,3,8,4,4,3,4,
%U A191090 2,3,2,6,4,5,5,3,4,2,3,4,9,4,3,4,6,5
%N A191090 a(n)^2 is the largest square required when writing n as a partition of squares.
%C A191090 If we write n as the sum of nondecreasing squares, then a(n) is the largest value such that n = a(n)^2 + ....
%H A191090 T. D. Noe, <a href="/A191090/b191090.txt">Table of n, a(n) for n = 1..1000</a>
%e A191090 a(8) = 2 because 8 = 2^2 + 2^2.
%t A191090 Table[Last[Union[First /@ Union /@ (DeleteCases[#, 0] & /@ PowersRepresentations[n, 11, 2])]], {n, 100}]
%Y A191090 Cf. A191091, A193018.
%K A191090 nonn
%O A191090 1,4
%A A191090 _T. D. Noe_, Jul 18 2011