A356281 - cp's OEIS frontend

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

n	a(n)
0	1
1	3
2	11
3	43
4	172
5	695
6	2823
7	11501
8	46940
9	191791
10	784148
11	3207196
12	13119733
13	53670793
14	219545353
15	897957702
16	3672093558
17	15013596535
18	61370565546
19	250803861369
20	1024716136043
21	4185683293934
22	17093143284723
23	69786349712519
24	284847779542644
25	1162385753008079

[1, 3, 11, 43, 172, 695, 2823, 11501, 46940, 191791, 784148, 3207196, 13119733, 53670793, 219545353, 897957702, 3672093558, 15013596535, 61370565546, 250803861369, 1024716136043, 4185683293934, 17093143284723, 69786349712519, 284847779542644, 1162385753008079]

cp's OEIS Frontend

A356281 a(n) = Sum_{k=0..n} binomial(2n, n-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

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

Table of values

List of values

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