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.

A256130 Number T(n,k) of partitions of n into parts of exactly k sorts which are introduced in ascending order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 2
5 1
6 0
7 3
8 4
9 1
10 0
11 5
12 12
13 7
14 1
15 0
16 7
17 30
18 33
19 11
20 1
21 0
22 11
23 72
24 130
25 77
26 16
27 1
28 0
29 15
30 160
31 463
32 438
33 157
34 22
35 1
36 0
37 22
38 351
39 1557
40 2216
41 1223
42 289
43 29
44 1
45 0
46 30
47 743
48 5031
49 10422
50 8331
51 2957
52 492
53 37
54 1
55 0
56 42
57 1561
58 15877
59 46731
60 52078
61 26073
62 6401
63 788
64 46
65 1

List of values

[1, 0, 1, 0, 2, 1, 0, 3, 4, 1, 0, 5, 12, 7, 1, 0, 7, 30, 33, 11, 1, 0, 11, 72, 130, 77, 16, 1, 0, 15, 160, 463, 438, 157, 22, 1, 0, 22, 351, 1557, 2216, 1223, 289, 29, 1, 0, 30, 743, 5031, 10422, 8331, 2957, 492, 37, 1, 0, 42, 1561, 15877, 46731, 52078, 26073, 6401, 788, 46, 1]