|
Search: id:A066535
|
|
|
| A066535 |
|
Number of ways of writing n as a sum of n squares. |
|
+0
2
|
|
| 2, 4, 8, 24, 112, 544, 2368, 9328, 34802, 129064, 491768, 1938336, 7801744, 31553344, 127083328, 509145568, 2035437440, 8148505828, 32728127192, 131880275664, 532597541344, 2153312518240, 8710505815360, 35250721087168
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
There are a(3)=8 solutions (x,y,z) of 3=x^2+y^2+z^2: (1,1,1), (-1,-1,-1), 3 permutations of (1,1,-1) and 3 permutations of (1,-1,-1).
|
|
MATHEMATICA
|
a[ n_ ] := SumOfSquaresR[ n, n ] (* First load package NumberTheory`NumberTheoryFunctions` *)
|
|
CROSSREFS
|
Cf. A004018, A005875, A000118, A066536.
Adjacent sequences: A066532 A066533 A066534 this_sequence A066536 A066537 A066538
Sequence in context: A065654 A002908 A004528 this_sequence A000643 A112285 A037170
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Peter Bertok (peter(AT)bertok.com), Jan 07 2002
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Jan 12, 2002.
|
|
|
Search completed in 0.002 seconds
|
