|
%I #10 Nov 03 2020 23:43:24
%S 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,
%T 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,
%U 1,1,1,2,1,1,1,2,1,1,1,1,1,1,1,1,1
%N 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).
%e 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.
%K nonn
%O 1,2
%A _Erich Friedman_
%E a(2) and a(3) corrected and title improved by _Sean A. Irvine_, Nov 03 2020
|
