This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A124970 Smallest positive integer which can be expressed as the ordered sum of 3 squares in exactly n different ways. 1
 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; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS 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: A199669 A197019 A048835 * A251768 A178034 A124886 Adjacent sequences:  A124967 A124968 A124969 * A124971 A124972 A124973 KEYWORD nonn AUTHOR Artur Jasinski, Nov 14 2006, Nov 20 2006 EXTENSIONS Extended by Ray Chandler, Nov 30 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 19:58 EST 2019. Contains 319251 sequences. (Running on oeis4.)