|
| |
|
|
A065459
|
|
Number of inequivalent (ordered) solutions to n^2 = sum of 5 squares of integers >= 0.
|
|
0
| |
|
|
1, 2, 2, 3, 4, 5, 6, 7, 8, 13, 12, 13, 17, 25, 22, 27, 31, 35, 38, 46, 49, 61, 61, 61, 73, 92, 83, 112, 106, 118, 127, 147, 138, 185, 175, 178, 198, 239, 212, 254, 262, 298, 294, 341, 304, 404, 376, 385, 432, 483, 441, 539, 517, 560, 551, 680, 587, 745, 693, 698
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
EXAMPLE
| a(5)=4 because 25 produces {0,0,0,0,5},{0,0,0,3,4},{0,1,2,2,4},{2,2,2,2,3}
|
|
|
MATHEMATICA
| Length/@Table[SumOfSquaresRepresentations[5, (k)^2], {k, 72}]
|
|
|
CROSSREFS
| A063014, A016727
Sequence in context: A001302 A001313 A057537 * A011873 A173151 A008673
Adjacent sequences: A065456 A065457 A065458 * A065460 A065461 A065462
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Wouter Meeussen, Nov 18, 2001
|
| |
|
|
