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.

A381299 Irregular triangular array read by rows. T(n,k) is the number of ordered set partitions of [n] with exactly k descents, n>=0, 0<=k<=binomial(n,2).

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 4
5 4
6 4
7 1
8 8
9 12
10 18
11 18
12 12
13 6
14 1
15 16
16 32
17 60
18 84
19 100
20 92
21 76
22 48
23 24
24 8
25 1
26 32
27 80
28 176
29 300
30 448
31 572
32 650
33 658
34 596
35 478
36 334
37 206
38 102
39 40
40 10
41 1
42 64
43 192
44 480
45 944
46 1632
47 2476
48 3428
49 4300
50 5008
51 5372
52 5356
53 4936
54 4220
55 3316
56 2392
57 1556
58 904
59 456
60 188
61 60
62 12
63 1

List of values

[1, 1, 2, 1, 4, 4, 4, 1, 8, 12, 18, 18, 12, 6, 1, 16, 32, 60, 84, 100, 92, 76, 48, 24, 8, 1, 32, 80, 176, 300, 448, 572, 650, 658, 596, 478, 334, 206, 102, 40, 10, 1, 64, 192, 480, 944, 1632, 2476, 3428, 4300, 5008, 5372, 5356, 4936, 4220, 3316, 2392, 1556, 904, 456, 188, 60, 12, 1]