A113263 - cp's OEIS frontend

A113263 a(n) is the number of ways the set {1^3, 2^3, ..., n^3} can be partitioned into two sets of equal sums.

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	0
10	0
11	0
12	1
13	0
14	0
15	2
16	1
17	0
18	0
19	2
20	62
21	0
22	0
23	268
24	356
25	0
26	0
27	2287
28	1130
29	0
30	0
31	5317
32	36879
33	0
34	0
35	203016
36	319415
37	0
38	0
39	2124580
40	1631750
41	0
42	0
43	10953868
44	41280525
45	0
46	0
47	242899218
48	472958485
49	0
50	0
51	2984270739
52	3419746788
53	0
54	0

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 1, 0, 0, 2, 62, 0, 0, 268, 356, 0, 0, 2287, 1130, 0, 0, 5317, 36879, 0, 0, 203016, 319415, 0, 0, 2124580, 1631750, 0, 0, 10953868, 41280525, 0, 0, 242899218, 472958485, 0, 0, 2984270739, 3419746788, 0, 0]

cp's OEIS Frontend

A113263 a(n) is the number of ways the set {1^3, 2^3, ..., n^3} can be partitioned into two sets of equal sums.

Table of values

List of values