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.

A144510 Array T(n,k) (n >= 1, k >= 0) read by downwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., i] into exactly k nonempty blocks, each of size at most n, for any i in the range n <= i <= k*n.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 7
9 3
10 1
11 1
12 37
13 31
14 4
15 1
16 1
17 266
18 842
19 121
20 5
21 1
22 1
23 2431
24 45296
25 18252
26 456
27 6
28 1
29 1
30 27007
31 4061871
32 7958726
33 405408
34 1709
35 7
36 1
37 1
38 353522
39 546809243
40 7528988476
41 1495388159
42 9268549
43 6427
44 8
45 1

List of values

[1, 1, 1, 1, 2, 1, 1, 7, 3, 1, 1, 37, 31, 4, 1, 1, 266, 842, 121, 5, 1, 1, 2431, 45296, 18252, 456, 6, 1, 1, 27007, 4061871, 7958726, 405408, 1709, 7, 1, 1, 353522, 546809243, 7528988476, 1495388159, 9268549, 6427, 8, 1]