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.

A132312 Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) into distinct 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 0
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 2
17 3
18 3
19 2
20 1
21 1
22 4
23 7
24 6
25 7
26 4
27 1
28 1
29 4
30 11
31 14
32 14
33 11
34 4
35 1
36 1
37 5
38 28
39 57
40 56
41 57
42 28
43 5
44 1
45 1
46 7
47 73
48 273
49 434
50 434
51 273
52 73
53 7
54 1
55 1
56 10
57 189
58 1411
59 3479
60 3980
61 3479
62 1411
63 189
64 10
65 1
66 1
67 11
68 300
69 4138
70 16293
71 26555
72 26555
73 16293
74 4138
75 300
76 11
77 1

List of values

[0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 3, 2, 1, 1, 4, 7, 6, 7, 4, 1, 1, 4, 11, 14, 14, 11, 4, 1, 1, 5, 28, 57, 56, 57, 28, 5, 1, 1, 7, 73, 273, 434, 434, 273, 73, 7, 1, 1, 10, 189, 1411, 3479, 3980, 3479, 1411, 189, 10, 1, 1, 11, 300, 4138, 16293, 26555, 26555, 16293, 4138, 300, 11, 1]