A069918 - cp's OEIS frontend

A069918 Number of ways of partitioning the set {1...n} into two subsets whose sums are as nearly equal as possible.

n	a(n)
1	1
2	1
3	1
4	1
5	3
6	5
7	4
8	7
9	23
10	40
11	35
12	62
13	221
14	397
15	361
16	657
17	2410
18	4441
19	4110
20	7636
21	28460
22	53222
23	49910
24	93846
25	353743
26	668273
27	632602
28	1199892
29	4559828
30	8679280
31	8273610
32	15796439
33	60400688
34	115633260
35	110826888
36	212681976
37	817175698
38	1571588177
39	1512776590

[1, 1, 1, 1, 3, 5, 4, 7, 23, 40, 35, 62, 221, 397, 361, 657, 2410, 4441, 4110, 7636, 28460, 53222, 49910, 93846, 353743, 668273, 632602, 1199892, 4559828, 8679280, 8273610, 15796439, 60400688, 115633260, 110826888, 212681976, 817175698, 1571588177, 1512776590]

cp's OEIS Frontend

A069918 Number of ways of partitioning the set {1...n} into two subsets whose sums are as nearly equal as possible.

Table of values

List of values