A300862 - cp's OEIS frontend

A300862 Solution to 1 = Sum_y Product_{k in y} a(k) for each n > 0, where the sum is over all integer partitions of n with an odd number of parts.

n	a(n)
1	1
2	1
3	0
4	0
5	-1
6	-1
7	0
8	1
9	1
10	0
11	-2
12	-3
13	-2
14	2
15	7
16	6
17	-3
18	-15
19	-19
20	-2
21	32
22	54
23	24
24	-64
25	-153
26	-123
27	95
28	389
29	444
30	-43
31	-966
32	-1475
33	-516
34	2066
35	4414
36	3092
37	-3874
38	-12480
39	-12936
40	3847
41	32445
42	45494
43	8950
44	-77282
45	-147663
46	-86313
47	157456
48	435623
49	399041
50	-229616
51	-1211479
52	-1535700
53	-73132

[1, 1, 0, 0, -1, -1, 0, 1, 1, 0, -2, -3, -2, 2, 7, 6, -3, -15, -19, -2, 32, 54, 24, -64, -153, -123, 95, 389, 444, -43, -966, -1475, -516, 2066, 4414, 3092, -3874, -12480, -12936, 3847, 32445, 45494, 8950, -77282, -147663, -86313, 157456, 435623, 399041, -229616, -1211479, -1535700, -73132]

cp's OEIS Frontend

A300862 Solution to 1 = Sum_y Product_{k in y} a(k) for each n > 0, where the sum is over all integer partitions of n with an odd number of parts.

Table of values

List of values