|
Search: id:A000152
|
|
|
| A000152 |
|
Number of ways of writing n as a sum of 16 squares. |
|
+0
3
|
|
| 1, 32, 480, 4480, 29152, 140736, 525952, 1580800, 3994080, 8945824, 18626112, 36714624, 67978880, 118156480, 197120256, 321692928, 509145568, 772845120, 1143441760, 1681379200, 2428524096, 3392205824, 4658843520, 6411152640
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 314.
E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, NY, 1985, p. 107.
S. C. Milne, Infinite families of exact sums of squares formulas, Jacobi elliptic functions, continued fractions and Schur functions, Ramanujan J., 6 (2002), 7-149.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..10000
Index entries for sequences related to sums of squares
|
|
MAPLE
|
(sum(x^(m^2), m=-10..10))^16;
|
|
MATHEMATICA
|
Needs["NumberTheory`NumberTheoryFunctions`"]; Table[SumOfSquaresR[16, n], {n, 0, 23}] (*Chandler*)
|
|
CROSSREFS
|
Cf. A022047(n)=A000152(2*n).
Adjacent sequences: A000149 A000150 A000151 this_sequence A000153 A000154 A000155
Sequence in context: A010837 A022724 A125467 this_sequence A022069 A085539 A091364
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 28 2006
|
|
|
Search completed in 0.004 seconds
|
