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.

A144643 Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3 or 4 (n >= 0, 0 <= k <= 4n).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 1
6 0
7 0
8 1
9 3
10 7
11 15
12 25
13 35
14 35
15 0
16 0
17 0
18 1
19 6
20 25
21 90
22 280
23 770
24 1855
25 3675
26 5775
27 5775
28 0
29 0
30 0
31 0
32 1
33 10
34 65
35 350
36 1645
37 6930
38 26425
39 90475
40 275275
41 725725
42 1576575
43 2627625
44 2627625
45 0
46 0
47 0
48 0
49 0
50 1
51 15
52 140
53 1050
54 6825
55 39795
56 211750
57 1033725
58 4629625

List of values

[1, 0, 1, 1, 1, 1, 0, 0, 1, 3, 7, 15, 25, 35, 35, 0, 0, 0, 1, 6, 25, 90, 280, 770, 1855, 3675, 5775, 5775, 0, 0, 0, 0, 1, 10, 65, 350, 1645, 6930, 26425, 90475, 275275, 725725, 1576575, 2627625, 2627625, 0, 0, 0, 0, 0, 1, 15, 140, 1050, 6825, 39795, 211750, 1033725, 4629625]