A191090 - OEIS

%I #13 Dec 12 2015 15:50:44

%S 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 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 2,3,2,6,4,5,5,3,4,2,3,4,9,4,3,4,6,5

%N a(n)^2 is the largest square required when writing n as a partition of squares.

%C If we write n as the sum of nondecreasing squares, then a(n) is the largest value such that n = a(n)^2 + ....

%H T. D. Noe, <a href="/A191090/b191090.txt">Table of n, a(n) for n = 1..1000</a>

%e a(8) = 2 because 8 = 2^2 + 2^2.

%t Table[Last[Union[First /@ Union /@ (DeleteCases[#, 0] & /@ PowersRepresentations[n, 11, 2])]], {n, 100}]

%Y Cf. A191091, A193018.

%K nonn

%O 1,4

%A _T. D. Noe_, Jul 18 2011