|
| |
|
|
A065461
|
|
Number of inequivalent (ordered) solutions to n^2 = sum of 7 squares of integers >= 0.
|
|
0
| |
|
|
1, 2, 3, 4, 7, 10, 13, 16, 27, 36, 43, 58, 72, 99, 130, 146, 178, 254, 265, 342, 417, 507, 540, 726, 745, 975, 1092, 1289, 1338, 1845, 1751, 2246, 2447, 2948, 2852, 3932, 3638, 4728, 4868, 5778, 5618, 7659, 6887, 8891, 8887, 10825, 10109, 13712
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
EXAMPLE
| a(4)=4 because 16 produces {0,0,0,0,0,0,4},{0,0,0,2,2,2,2},{0,0,1,1,1,2,3},{1,1,1,1,2,2,2}
|
|
|
MATHEMATICA
| Length/@Table[SumOfSquaresRepresentations[7, (k)^2], {k, 48}]
|
|
|
CROSSREFS
| A063014, A016727
Sequence in context: A008811 A144678 A073149 * A008824 A081942 A189720
Adjacent sequences: A065458 A065459 A065460 * A065462 A065463 A065464
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Wouter Meeussen, Nov 18, 2001
|
| |
|
|
