A084966 Minimum numbers of squares needed to write n! as a sum of nonzero squares.

1, 2, 3, 3, 3, 2, 3, 3, 3, 4, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3

Offset

1,2

Links

Table of n, a(n) for n=1..105.

Dario Alpern, Sum of squares web application

Example

a(2)=2 because 2!=1^2+1^2; a(3)=3: 3!=6=2^2+1+1; a(6)=2: 6!=720=24^2+12^2

Prog

See link.

Crossrefs

Cf. A000142, A001481, A000419, A004215, A084953.

Sequence in context: A352628 A080748 A305374 * A303432 A224748 A165494

Adjacent sequences: A084963 A084964 A084965 * A084967 A084968 A084969

Keyword

nonn

Author

Hugo Pfoertner, Jun 15 2003

Status

approved