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.

A132311 Triangle read by rows: T(n,k) is the number of partitions of binomial(n,k) into parts of the first n rows of Pascal's triangle, 0<=k<=n.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 1
5 1
6 1
7 2
8 2
9 1
10 1
11 4
12 7
13 4
14 1
15 1
16 6
17 28
18 28
19 6
20 1
21 1
22 11
23 117
24 318
25 117
26 11
27 1
28 1
29 14
30 388
31 3344
32 3344
33 388
34 14
35 1
36 1
37 21
38 1757
39 71277
40 290521
41 71277
42 1757
43 21
44 1
45 1
46 29
47 8270
48 2031198
49 53679222
50 53679222
51 2031198
52 8270
53 29
54 1
55 1
56 42
57 40243
58 74464383
59 19465193506
60 147286801214
61 19465193506
62 74464383
63 40243
64 42
65 1

List of values

[0, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 4, 7, 4, 1, 1, 6, 28, 28, 6, 1, 1, 11, 117, 318, 117, 11, 1, 1, 14, 388, 3344, 3344, 388, 14, 1, 1, 21, 1757, 71277, 290521, 71277, 1757, 21, 1, 1, 29, 8270, 2031198, 53679222, 53679222, 2031198, 8270, 29, 1, 1, 42, 40243, 74464383, 19465193506, 147286801214, 19465193506, 74464383, 40243, 42, 1]