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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036466 If n = Sum_{i} b(i)^2 (i.e., a partition of n into squares), then a(n) is the smallest possible value of the largest multiplicity of the b(i). 0
 1, 2, 3, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..85. 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: A308184 A114280 A123564 * A065882 A276327 A007884 Adjacent sequences: A036463 A036464 A036465 * A036467 A036468 A036469 KEYWORD nonn AUTHOR Erich Friedman EXTENSIONS a(2) and a(3) corrected and title improved by Sean A. Irvine, Nov 03 2020 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.

Last modified June 19 18:42 EDT 2024. Contains 373507 sequences. (Running on oeis4.)