cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Table of values

n a(n)
0 1
1 3
2 11
3 62
4 289
5 1472
6 7581
7 38014
8 184453
9 918512
10 4548393
11 22077762
12 107423503
13 516720332
14 2483445404
15 11959145079
16 57022343425
17 270173627092
18 1282971321633
19 6047971597490
20 28446033085527
21 133714464665108
22 625893086713686
23 2919093380089383
24 13596052503945537

List of values

[1, 3, 11, 62, 289, 1472, 7581, 38014, 184453, 918512, 4548393, 22077762, 107423503, 516720332, 2483445404, 11959145079, 57022343425, 270173627092, 1282971321633, 6047971597490, 28446033085527, 133714464665108, 625893086713686, 2919093380089383, 13596052503945537]