A308682 - cp's OEIS frontend

A308682 Number of ways of partitioning the set of the first n positive triangular numbers into two subsets whose sums differ at most by 1.

n	a(n)
0	1
1	1
2	0
3	0
4	1
5	1
6	1
7	1
8	2
9	7
10	6
11	8
12	13
13	42
14	33
15	52
16	105
17	318
18	310
19	485
20	874
21	3281
22	2974
23	5240
24	9488
25	34233
26	30418
27	55715
28	104730
29	378529
30	352467
31	642418
32	1193879
33	4466874
34	4165910
35	7762907
36	14493951
37	54162165
38	50621491
39	95133799
40	179484713
41	674845081

[1, 1, 0, 0, 1, 1, 1, 1, 2, 7, 6, 8, 13, 42, 33, 52, 105, 318, 310, 485, 874, 3281, 2974, 5240, 9488, 34233, 30418, 55715, 104730, 378529, 352467, 642418, 1193879, 4466874, 4165910, 7762907, 14493951, 54162165, 50621491, 95133799, 179484713, 674845081]

cp's OEIS Frontend

A308682 Number of ways of partitioning the set of the first n positive triangular numbers into two subsets whose sums differ at most by 1.

Table of values

List of values