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.

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

Table of values

n a(n)
0 1
1 4
2 19
3 187
4 1177
5 10186
6 84442
7 665842
8 5078668
9 42573268
10 343023418
11 2665464058
12 21440629558
13 167644287550
14 1330569327310
15 10641989818078
16 82797155054782
17 644097780350332
18 5102709814966162
19 39499844158337962
20 307777892529889642
21 2406854983109480302

List of values

[1, 4, 19, 187, 1177, 10186, 84442, 665842, 5078668, 42573268, 343023418, 2665464058, 21440629558, 167644287550, 1330569327310, 10641989818078, 82797155054782, 644097780350332, 5102709814966162, 39499844158337962, 307777892529889642, 2406854983109480302]