A113038 - cp's OEIS frontend

A113038 Number of ways the set {1,2,...,n} can be split into three subsets of which the sum of one is one more than the equal sums of both other subsets.

n	a(n)
1	0
2	0
3	0
4	1
5	0
6	0
7	5
8	0
9	0
10	60
11	0
12	0
13	747
14	0
15	0
16	11076
17	0
18	0
19	183092
20	0
21	0
22	3238140
23	0
24	0
25	60475317
26	0
27	0
28	1175471401
29	0
30	0
31	23600724220
32	0
33	0
34	486653058995
35	0
36	0
37	10260353188386
38	0
39	0
40	220439819437387
41	0
42	0
43	4813287355239594
44	0
45	0
46	106583271423691692
47	0
48	0

[0, 0, 0, 1, 0, 0, 5, 0, 0, 60, 0, 0, 747, 0, 0, 11076, 0, 0, 183092, 0, 0, 3238140, 0, 0, 60475317, 0, 0, 1175471401, 0, 0, 23600724220, 0, 0, 486653058995, 0, 0, 10260353188386, 0, 0, 220439819437387, 0, 0, 4813287355239594, 0, 0, 106583271423691692, 0, 0]

cp's OEIS Frontend

A113038 Number of ways the set {1,2,...,n} can be split into three subsets of which the sum of one is one more than the equal sums of both other subsets.

Table of values

List of values