login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118653 Least number of squares that add up to the partition number A000041(n). 0
1, 1, 2, 3, 2, 4, 3, 4, 3, 3, 3, 3, 3, 2, 4, 3, 4, 3, 3, 2, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 2, 3, 4, 3, 3, 4, 3, 3, 4, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 2, 2, 4, 2, 3, 3, 4, 3, 4, 3, 3, 4, 3, 2, 4, 4, 4, 3, 3, 2, 3, 3, 3, 2, 2, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = A002828(A000041(n)).
EXAMPLE
a(20) = 3 because P(20) = 627 = 25^2 + 1^2 + 1^2.
a(36) = 2 because P(36) = 17977 = 124^2 + 51^2, which is prime.
a(66) = 2 because P(66) = 2323520 = 1504^2 + 248^2.
a(67) = 2 because P(67) = 2679689 = 1205^2 + 1108^2.
a(100) = 3 because P(100) = 190569292 = 13730^2 + 1434^2 + 6^2.
CROSSREFS
Sequence in context: A324183 A335616 A004596 * A173753 A295753 A144968
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, May 17 2006
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)