A060005 - cp's OEIS frontend

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}.

n	a(n)
0	1
1	1
2	7
3	62
4	657
5	7636
6	93846
7	1199892
8	15796439
9	212681976
10	2915017360
11	40536016030
12	570497115729
13	8110661588734
14	116307527411482
15	1680341334827514
16	24435006625667338
17	357366669614512168
18	5253165510907071170

[1, 1, 7, 62, 657, 7636, 93846, 1199892, 15796439, 212681976, 2915017360, 40536016030, 570497115729, 8110661588734, 116307527411482, 1680341334827514, 24435006625667338, 357366669614512168, 5253165510907071170]

cp's OEIS Frontend

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}.

Table of values

List of values