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

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

Offset: 1

Author

T. D. Noe, Jul 18 2011

Keywords

• nonn

Comments

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

Examples

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

Links

• T. D. Noe, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A191091, A193018.

Programs

Mathematica

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