A104456 - cp's OEIS frontend

A104456 Number of ways of partitioning the integers {1,2,..,4n-1} into two unordered sets such that the sums of parts are equal in both sets (parts in one of the sets hence sum up to n*(4n-1)). Number of solutions to {1 +- 2 +- 3+ ... +- 4n-1 = 0}.

n	a(n)
1	1
2	4
3	35
4	361
5	4110
6	49910
7	632602
8	8273610
9	110826888
10	1512776590
11	20965992017
12	294245741167
13	4173319332859
14	59723919552183
15	861331863890066
16	12505857230438737
17	182650875111521033
18	2681644149792639400
19	39555354718945873299
20	585903163431438401072

[1, 4, 35, 361, 4110, 49910, 632602, 8273610, 110826888, 1512776590, 20965992017, 294245741167, 4173319332859, 59723919552183, 861331863890066, 12505857230438737, 182650875111521033, 2681644149792639400, 39555354718945873299, 585903163431438401072]

cp's OEIS Frontend

A104456 Number of ways of partitioning the integers {1,2,..,4n-1} into two unordered sets such that the sums of parts are equal in both sets (parts in one of the sets hence sum up to n*(4n-1)). Number of solutions to {1 +- 2 +- 3+ ... +- 4n-1 = 0}.

Table of values

List of values