A290889 - cp's OEIS frontend

A290889 Number of partitions of the set of odd numbers {1, 3, ..., 2*n-1} into two subsets such that the absolute difference of the sums of the two subsets is minimized.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	5
8	4
9	13
10	10
11	38
12	34
13	118
14	103
15	380
16	346
17	1262
18	1153
19	4277
20	3965
21	14745
22	13746
23	51541
24	48396
25	182182
26	171835
27	650095
28	615966
29	2338706
30	2223755
31	8472697
32	8082457
33	30884150
34	29543309
35	113189168
36	108545916
37	416839177
38	400623807
39	1541726967

[1, 1, 1, 1, 2, 1, 5, 4, 13, 10, 38, 34, 118, 103, 380, 346, 1262, 1153, 4277, 3965, 14745, 13746, 51541, 48396, 182182, 171835, 650095, 615966, 2338706, 2223755, 8472697, 8082457, 30884150, 29543309, 113189168, 108545916, 416839177, 400623807, 1541726967]

cp's OEIS Frontend

A290889 Number of partitions of the set of odd numbers {1, 3, ..., 2*n-1} into two subsets such that the absolute difference of the sums of the two subsets is minimized.

Table of values

List of values