|
Search: id:A065460
|
|
|
| A065460 |
|
Number of inequivalent (ordered) solutions to n^2 = sum of 6 squares of integers >= 0. |
|
+0
1
|
|
| 1, 2, 3, 3, 5, 9, 9, 9, 18, 23, 24, 29, 37, 53, 62, 59, 77, 116, 106, 130, 156, 199, 192, 221, 257, 342, 336, 384, 402, 577, 501, 599, 639, 835, 774, 910, 912, 1220, 1113, 1378, 1298, 1703, 1530, 1907, 1862, 2398, 2094, 2471, 2393, 3356, 2765, 3543
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(5)=5 because 25 produces {0,0,0,0,0,5},{0,0,0,0,3,4},{0,0,1,2,2,4},{0,2,2,2,2,3},{1,1,1,2,3,3}
|
|
MATHEMATICA
|
Length/@Table[SumOfSquaresRepresentations[6, (k)^2], {k, 72}]
|
|
CROSSREFS
|
A063014, A016727
Sequence in context: A107854 A118808 A059503 this_sequence A001180 A019460 A049855
Adjacent sequences: A065457 A065458 A065459 this_sequence A065461 A065462 A065463
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Wouter Meeussen, Nov 18, 2001
|
|
|
Search completed in 0.002 seconds
|
