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.

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

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 1
5 1
6 1
7 0
8 0
9 1
10 3
11 7
12 15
13 31
14 63
15 119
16 210
17 336
18 462
19 462
20 0
21 0
22 0
23 1
24 6
25 25
26 90
27 301
28 966
29 2989
30 8925
31 25641
32 70455
33 183183
34 441441
35 966966
36 1849848
37 2858856
38 2858856
39 0
40 0
41 0
42 0
43 1
44 10
45 65
46 350
47 1701
48 7770
49 33985
50 143605
51 588511

List of values

[0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 3, 7, 15, 31, 63, 119, 210, 336, 462, 462, 0, 0, 0, 1, 6, 25, 90, 301, 966, 2989, 8925, 25641, 70455, 183183, 441441, 966966, 1849848, 2858856, 2858856, 0, 0, 0, 0, 1, 10, 65, 350, 1701, 7770, 33985, 143605, 588511]