This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036466 If n=sum a_i^2, then a(n) is the smallest possible value of the largest multiplicity of the a_i. 0
 1, 4, 2, 1, 1, 2, 3, 2, 1, 1, 2, 3, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE a(12)=3 since 12 = 2^2 + 2^2 + 2^2 = 3^2 + 1^2 + 1^2 + 1^2 and 3 of the same square are needed. CROSSREFS Sequence in context: A204815 A247642 A144260 * A097526 A051149 A293424 Adjacent sequences:  A036463 A036464 A036465 * A036467 A036468 A036469 KEYWORD nonn AUTHOR 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.

Last modified June 26 20:37 EDT 2019. Contains 324380 sequences. (Running on oeis4.)