A374087 - cp's OEIS frontend

A374087 a(n) is the number of ways to partition {1,2,...,n} into two sets X and Y such that the sum of the elements of each is a square.

n	a(n)
0	1
1	1
2	0
3	0
4	1
5	0
6	0
7	0
8	1
9	8
10	0
11	0
12	0
13	0
14	0
15	0
16	365
17	8
18	0
19	0
20	0
21	0
22	0
23	0
24	0
25	91514
26	0
27	0
28	0
29	0
30	0
31	0
32	0
33	0
34	0
35	0
36	104742767
37	0
38	0
39	0
40	6519062
41	0
42	0
43	0
44	0
45	0
46	0
47	0
48	0
49	531168463492
50	0
51	0
52	15329991499
53	0
54	0
55	0
56	0
57	0
58	0
59	0
60	0
61	0
62	0
63	0
64	11530164811834907
65	0
66	0
67	0
68	0

[1, 1, 0, 0, 1, 0, 0, 0, 1, 8, 0, 0, 0, 0, 0, 0, 365, 8, 0, 0, 0, 0, 0, 0, 0, 91514, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 104742767, 0, 0, 0, 6519062, 0, 0, 0, 0, 0, 0, 0, 0, 531168463492, 0, 0, 15329991499, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11530164811834907, 0, 0, 0, 0]

cp's OEIS Frontend

A374087 a(n) is the number of ways to partition {1,2,...,n} into two sets X and Y such that the sum of the elements of each is a square.

Table of values

List of values