A116681 - cp's OEIS frontend

A116681 Triangle read by rows: T(n,k) is the number of partitions of n into distinct parts, in which the sum of the odd parts is k (n>=0, 0<=k<=n).

n	a(n)
0	1
1	0
2	1
3	1
4	0
5	0
6	0
7	1
8	0
9	1
10	1
11	0
12	0
13	0
14	1
15	0
16	1
17	0
18	1
19	0
20	1
21	2
22	0
23	0
24	0
25	1
26	0
27	1
28	0
29	2
30	0
31	1
32	0
33	1
34	0
35	1
36	2
37	0
38	0
39	0
40	1
41	0
42	1
43	0
44	2
45	0
46	2
47	0
48	2
49	0
50	1
51	0
52	1
53	0
54	2
55	3
56	0
57	0
58	0
59	2
60	0
61	1
62	0
63	2
64	0
65	2
66	0
67	3
68	0
69	2
70	0
71	2
72	0
73	1
74	0
75	2
76	0
77	2
78	4
79	0
80	0
81	0
82	2
83	0
84	2
85	0
86	2
87	0
88	2
89	0
90	3
91	0
92	4
93	0
94	3
95	0
96	2
97	0
98	2
99	0
100	2
101	0
102	2
103	0
104	3

[1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 2, 0, 0, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 2, 0, 0, 0, 1, 0, 1, 0, 2, 0, 2, 0, 2, 0, 1, 0, 1, 0, 2, 3, 0, 0, 0, 2, 0, 1, 0, 2, 0, 2, 0, 3, 0, 2, 0, 2, 0, 1, 0, 2, 0, 2, 4, 0, 0, 0, 2, 0, 2, 0, 2, 0, 2, 0, 3, 0, 4, 0, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 3]

cp's OEIS Frontend

A116681 Triangle read by rows: T(n,k) is the number of partitions of n into distinct parts, in which the sum of the odd parts is k (n>=0, 0<=k<=n).

Table of values

List of values

n	a(n)
0	1
1	0
2	1
3	1
4	0
5	0
6	0
7	1
8	0
9	1
10	1
11	0
12	0
13	0
14	1
15	0
16	1
17	0
18	1
19	0
20	1
21	2
22	0
23	0
24	0
25	1
26	0
27	1
28	0
29	2
30	0
31	1
32	0
33	1
34	0
35	1
36	2
37	0
38	0
39	0
40	1
41	0
42	1
43	0
44	2
45	0
46	2
47	0
48	2
49	0
50	1
51	0
52	1
53	0
54	2
55	3
56	0
57	0
58	0
59	2
60	0
61	1
62	0
63	2
64	0
65	2
66	0
67	3
68	0
69	2
70	0
71	2
72	0
73	1
74	0
75	2
76	0
77	2
78	4
79	0
80	0
81	0
82	2
83	0
84	2
85	0
86	2
87	0
88	2
89	0
90	3
91	0
92	4
93	0
94	3
95	0
96	2
97	0
98	2
99	0
100	2
101	0
102	2
103	0
104	3

n	a(n)
0	1
1	0
2	1
3	1
4	0
5	0
6	0
7	1
8	0
9	1
10	1
11	0
12	0
13	0
14	1
15	0
16	1
17	0
18	1
19	0
20	1
21	2
22	0
23	0
24	0
25	1
26	0
27	1
28	0
29	2
30	0
31	1
32	0
33	1
34	0
35	1
36	2
37	0
38	0
39	0
40	1
41	0
42	1
43	0
44	2
45	0
46	2
47	0
48	2
49	0
50	1
51	0
52	1
53	0
54	2
55	3
56	0
57	0
58	0
59	2
60	0
61	1
62	0
63	2
64	0
65	2
66	0
67	3
68	0
69	2
70	0
71	2
72	0
73	1
74	0
75	2
76	0
77	2
78	4
79	0
80	0
81	0
82	2
83	0
84	2
85	0
86	2
87	0
88	2
89	0
90	3
91	0
92	4
93	0
94	3
95	0
96	2
97	0
98	2
99	0
100	2
101	0
102	2
103	0
104	3

n	a(n)
0	1
1	0
2	1
3	1
4	0
5	0
6	0
7	1
8	0
9	1
10	1
11	0
12	0
13	0
14	1
15	0
16	1
17	0
18	1
19	0
20	1
21	2
22	0
23	0
24	0
25	1
26	0
27	1
28	0
29	2
30	0
31	1
32	0
33	1
34	0
35	1
36	2
37	0
38	0
39	0
40	1
41	0
42	1
43	0
44	2
45	0
46	2
47	0
48	2
49	0
50	1
51	0
52	1
53	0
54	2
55	3
56	0
57	0
58	0
59	2
60	0
61	1
62	0
63	2
64	0
65	2
66	0
67	3
68	0
69	2
70	0
71	2
72	0
73	1
74	0
75	2
76	0
77	2
78	4
79	0
80	0
81	0
82	2
83	0
84	2
85	0
86	2
87	0
88	2
89	0
90	3
91	0
92	4
93	0
94	3
95	0
96	2
97	0
98	2
99	0
100	2
101	0
102	2
103	0
104	3