A111253 - cp's OEIS frontend

A111253 a(n) is the number of ways the set {1^4, 2^4, ..., n^4} 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	0
13	0
14	0
15	0
16	1
17	0
18	0
19	8
20	9
21	0
22	0
23	16
24	50
25	0
26	0
27	212
28	255
29	0
30	0
31	1396
32	2994
33	0
34	0
35	14529
36	22553
37	0
38	0
39	138414
40	236927
41	0
42	0
43	1227670
44	2388718
45	0
46	0
47	13733162
48	23214820
49	0
50	0
51	140197641
52	263244668
53	0
54	0
55	1596794975
56	2830613464
57	0
58	0

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 8, 9, 0, 0, 16, 50, 0, 0, 212, 255, 0, 0, 1396, 2994, 0, 0, 14529, 22553, 0, 0, 138414, 236927, 0, 0, 1227670, 2388718, 0, 0, 13733162, 23214820, 0, 0, 140197641, 263244668, 0, 0, 1596794975, 2830613464, 0, 0]

cp's OEIS Frontend

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

Table of values

List of values