A307877 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	0
3	0
4	0
5	0
6	2
7	1
8	1
9	5
10	2
11	1
12	5
13	13
14	43
15	43
16	57
17	193
18	274
19	239
20	430
21	1552
22	3245
23	2904
24	5419
25	18628
26	31048
27	27813
28	50213
29	188536
30	372710
31	348082
32	649300
33	2376996
34	4197425
35	3913496
36	7287183
37	27465147
38	53072709
39	50030553
40	93696497
41	351329160
42	650125358

[1, 1, 0, 0, 0, 0, 2, 1, 1, 5, 2, 1, 5, 13, 43, 43, 57, 193, 274, 239, 430, 1552, 3245, 2904, 5419, 18628, 31048, 27813, 50213, 188536, 372710, 348082, 649300, 2376996, 4197425, 3913496, 7287183, 27465147, 53072709, 50030553, 93696497, 351329160, 650125358]

cp's OEIS Frontend

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

Table of values

List of values