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.

A356283 a(n) = Sum_{k=0..n} binomial(3*n, 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 4
2 22
3 131
4 807
5 5066
6 32188
7 206242
8 1329733
9 8614685
10 56024538
11 365491218
12 2390613557
13 15671221522
14 102925324569
15 677110860689
16 4460956827127
17 29427611146335
18 194348311824025
19 1284856925961827
20 8502252246841668
21 56309476194587377
22 373220349572126265

List of values

[1, 4, 22, 131, 807, 5066, 32188, 206242, 1329733, 8614685, 56024538, 365491218, 2390613557, 15671221522, 102925324569, 677110860689, 4460956827127, 29427611146335, 194348311824025, 1284856925961827, 8502252246841668, 56309476194587377, 373220349572126265]