A356270 - cp's OEIS frontend

A356270 a(n) = Sum_{k=0..n} binomial(2k, k) q(k), where q(k) is the number of partitions into distinct parts (A000009).

n	a(n)
0	1
1	3
2	9
3	49
4	189
5	945
6	4641
7	21801
8	99021
9	487981
10	2335541
11	10800725
12	51363065
13	238573865
14	1121139065
15	5309312105
16	24543884585
17	113220920945
18	530677144745
19	2439321389945
20	11261499234425
21	52169097691865
22	239433905462945
23	1095710701133345
24	5029918350471545

[1, 3, 9, 49, 189, 945, 4641, 21801, 99021, 487981, 2335541, 10800725, 51363065, 238573865, 1121139065, 5309312105, 24543884585, 113220920945, 530677144745, 2439321389945, 11261499234425, 52169097691865, 239433905462945, 1095710701133345, 5029918350471545]

cp's OEIS Frontend

A356270 a(n) = Sum_{k=0..n} binomial(2k, k) q(k), where q(k) is the number of partitions into distinct parts (A000009).

Table of values

List of values

cp's OEIS Frontend

A356270 a(n) = Sum_{k=0..n} binomial(2*k, k) * q(k), where q(k) is the number of partitions into distinct parts (A000009).

Table of values

List of values

A356270 a(n) = Sum_{k=0..n} binomial(2k, k) q(k), where q(k) is the number of partitions into distinct parts (A000009).