A103414 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}.
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, 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, 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
Offset: 1