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.

A144512 Array read by upwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., k+1, for 0 <= k <= (k+1)*n.

Table of values

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

List of values

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