login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084966 Minimum numbers of squares needed to write n! as a sum of nonzero squares. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Dario Alpern, Java Applet: Sum of squares

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: A236552 A080748 A305374 * A303432 A224748 A165494

Adjacent sequences:  A084963 A084964 A084965 * A084967 A084968 A084969

KEYWORD

nonn

AUTHOR

Hugo Pfoertner, Jun 15 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 23:02 EDT 2019. Contains 321343 sequences. (Running on oeis4.)