A284609 - cp's OEIS frontend

A284609 Number of partitions of n such that the (sum of all odd parts) = floor(n/2).

n	a(n)
1	0
2	0
3	1
4	1
5	0
6	0
7	4
8	4
9	0
10	0
11	9
12	12
13	0
14	0
15	25
16	30
17	0
18	0
19	56
20	70
21	0
22	0
23	132
24	165
25	0
26	0
27	270
28	330
29	0
30	0
31	594
32	704
33	0
34	0
35	1140
36	1380
37	0
38	0
39	2268
40	2688
41	0
42	0
43	4256
44	4984
45	0
46	0
47	8008
48	9394
49	0
50	0
51	14342
52	16665
53	0
54	0
55	25920
56	29970
57	0
58	0
59	45056
60	52096

[0, 0, 1, 1, 0, 0, 4, 4, 0, 0, 9, 12, 0, 0, 25, 30, 0, 0, 56, 70, 0, 0, 132, 165, 0, 0, 270, 330, 0, 0, 594, 704, 0, 0, 1140, 1380, 0, 0, 2268, 2688, 0, 0, 4256, 4984, 0, 0, 8008, 9394, 0, 0, 14342, 16665, 0, 0, 25920, 29970, 0, 0, 45056, 52096]

cp's OEIS Frontend

A284609 Number of partitions of n such that the (sum of all odd parts) = floor(n/2).

Table of values

List of values