A113039 - cp's OEIS frontend

A113039 Number of ways the set {1,2,...,n} can be split into three subsets of which the three sums are consecutive.

n	a(n)
1	0
2	0
3	1
4	0
5	3
6	5
7	0
8	23
9	52
10	0
11	254
12	593
13	0
14	3611
15	8859
16	0
17	55554
18	142169
19	0
20	946871
21	2466282
22	0
23	17095813
24	45359632
25	0
26	323760077
27	870624976
28	0
29	6367406592
30	17307580710
31	0
32	129063054631
33	353941332518
34	0
35	2682355470491
36	7410591325928
37	0
38	56930627178287

[0, 0, 1, 0, 3, 5, 0, 23, 52, 0, 254, 593, 0, 3611, 8859, 0, 55554, 142169, 0, 946871, 2466282, 0, 17095813, 45359632, 0, 323760077, 870624976, 0, 6367406592, 17307580710, 0, 129063054631, 353941332518, 0, 2682355470491, 7410591325928, 0, 56930627178287]

cp's OEIS Frontend

A113039 Number of ways the set {1,2,...,n} can be split into three subsets of which the three sums are consecutive.

Table of values

List of values