|
Search: id:A060005
|
|
|
| A060005 |
|
Number of ways of partitioning the integers {1,2,..,4n} into two (unordered) sets such that the sums of parts are equal in both sets (parts in either set will add up to (4n)*(4n+1)/4). Number of solutions to {1 +- 2 +- 3 +- ... +- 4n=0}. |
|
+0
7
|
|
| 1, 1, 7, 62, 657, 7636, 93846, 1199892, 15796439, 212681976, 2915017360, 40536016030, 570497115729, 8110661588734, 116307527411482, 1680341334827514, 24435006625667338, 357366669614512168
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
