A302917 - cp's OEIS frontend

A302917 Solution to a(1) = 1 and Sum_y Product_i a(y_i) = 0 for each n > 1, where the sum is over all relatively prime or monic partitions of n.

n	a(n)
1	1
2	-1
3	0
4	0
5	-1
6	0
7	0
8	0
9	0
10	0
11	-1
12	1
13	-1
14	-1
15	1
16	1
17	-1
18	-1
19	0
20	1
21	1
22	-3
23	1
24	4
25	-5
26	-3
27	3
28	4
29	2
30	-6
31	-6
32	19
33	-8
34	-25
35	25
36	20
37	-12
38	-34
39	2
40	30
41	38
42	-117
43	54
44	159
45	-173
46	-123
47	55
48	229
49	32
50	-250
51	-148
52	753
53	-365
54	-1022
55	840
56	1121
57	-847
58	-1482
59	-390
60	2099

[1, -1, 0, 0, -1, 0, 0, 0, 0, 0, -1, 1, -1, -1, 1, 1, -1, -1, 0, 1, 1, -3, 1, 4, -5, -3, 3, 4, 2, -6, -6, 19, -8, -25, 25, 20, -12, -34, 2, 30, 38, -117, 54, 159, -173, -123, 55, 229, 32, -250, -148, 753, -365, -1022, 840, 1121, -847, -1482, -390, 2099]

cp's OEIS Frontend

A302917 Solution to a(1) = 1 and Sum_y Product_i a(y_i) = 0 for each n > 1, where the sum is over all relatively prime or monic partitions of n.

Table of values

List of values