|
Search: id:A122699
|
|
|
| A122699 |
|
Least integer that can be written as a sum of 3 squares in n nontrivial ways (ignoring order and signs). |
|
+0
2
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Essentially the same as A095809. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 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, 0, 9}, {1, 4, 8}, {3, 6, 6}, {4, 4, 7}
|
|
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: A073115 A096408 A005481 this_sequence A097604 A007393 A067152
Adjacent sequences: A122696 A122697 A122698 this_sequence A122700 A122701 A122702
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Wouter Meeussen (wouter.meeussen(AT)pandora.be), Oct 21 2006
|
|
|
Search completed in 0.002 seconds
|
