A122699 Least integer that can be written as a sum of 3 squares in n nontrivial ways (ignoring order and signs).

7, 0, 9, 41, 81, 146, 194, 306, 369, 425, 594, 689, 866, 1109, 1161, 1154, 1361, 1634, 1781, 1889, 2141, 2729, 2609, 3626, 3366, 3566, 3449, 3506, 4241, 4289, 4826, 5066, 5381, 7034, 5561, 6254, 7229, 7829, 8186, 8069, 8126, 8609, 8921, 8774, 10386

Offset

0,1

Comments

Essentially the same as A095809. [From R. J. Mathar, Aug 02 2008]

Links

Wouter Meeussen, Table of n, a(n) for n = 0..112

Example

a(4)=81 since it can be written as 0^2+0^2+9^2, 1^2+4^2+8^2, 3^2+6^2+6^2, 4^2+4^2+7^2.

Mathematica

Needs["NumberTheory`NumberTheoryFunctions`"]; Flatten[Position[Table[Length@SumOfSquaresRepresentations[3, n], {n, 0, 65000}], #, 1, 1]-1]& /@ Range[0, 120]

Crossrefs

Cf. A117609.

Sequence in context: A096408 A005481 A392026 * A262807 A169603 A022920

Adjacent sequences: A122696 A122697 A122698 * A122700 A122701 A122702

Keyword

nonn

Author

Wouter Meeussen, Oct 21 2006

Status

approved