|
Search: id:A124970
|
|
|
| A124970 |
|
Smallest positive integer which can be expressed as the ordered sum of 3 squares in exactly n different ways. |
|
+0
2
|
|
| 7, 1, 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
|
|
|
MATHEMATICA
|
Needs["NumberTheory`NumberTheoryFunctions`"]; f[n_] := Block[{k = 1}, While[Length @ OrderedSumOfSquaresRepresentations[3, k] != n, k++ ]; k]; Table[f[n], {n, 0, 50}] (*Chandler*)
|
|
CROSSREFS
|
Cf. A000451, A095809, A000437, A122699, A124966-A124971.
Sequence in context: A153870 A086722 A048835 this_sequence A124886 A061195 A074283
Adjacent sequences: A124967 A124968 A124969 this_sequence A124971 A124972 A124973
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Artur Jasinski (grafix(AT)csl.pl), Nov 14 2006, Nov 20 2006
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 30 2006
|
|
|
Search completed in 0.002 seconds
|
