%I
%S 1,1,1,1,1,1,1,1,1,2,1,2,1,1,1,1,2,1,1,4,1,1,1,1,1,3,1,1,3,5,2,1,1,1,
%T 1,1,3,1,1,2,2,1,1,1,1,3,1,1,2,5,3,1,1,3,2,1,3,5,1,6,1,1,2,2,2,2,1,2,
%U 1,2,1,1,1,2,1,1,1,1,3,2,5,1,3,10,4,9,1,1,1,1,5,5,4,6,9,1,4,1,1,2,1,1,2,1,9
%N Consider smallest m such that m^2 = x_1^2 + ... + x_n^2 with 0 < x_1 < ... < x_n. Sequence gives number of solutions {x_1,...,x_n}.
%Y Cf. A018935, A018936, A018937, A103411, A103412, A103413.
%K nonn
%O 1,10
%A _Ray Chandler_, Feb 04 2005
