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,10

Links

Table of n, a(n) for n=1..105.

Crossrefs

Cf. A018935, A018936, A018937, A103411, A103412, A103413.

Sequence in context: A375736 A184240 A244840 * A092400 A303598 A337277

Adjacent sequences: A103411 A103412 A103413 * A103415 A103416 A103417

Keyword

nonn

Author

Ray Chandler, Feb 04 2005

Status

approved