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.

A224652 Triangle read by rows: T(n,k) is the number of permutations of n elements with k the (smallest) header (first element) of the longest descending subsequence.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 3
7 1
8 5
9 8
10 10
11 1
12 14
13 25
14 35
15 45
16 1
17 42
18 89
19 141
20 196
21 251
22 1
23 132
24 357
25 644
26 966
27 1302
28 1638
29 1
30 429
31 1602
32 3284
33 5300
34 7526
35 9878
36 12300
37 1
38 1430
39 7959
40 18423
41 31947
42 47859
43 65619
44 84765
45 104877
46 1
47 4862
48 43127
49 112255
50 209500
51 331795
52 475738
53 637657
54 813730
55 1000135

List of values

[1, 1, 1, 1, 2, 3, 1, 5, 8, 10, 1, 14, 25, 35, 45, 1, 42, 89, 141, 196, 251, 1, 132, 357, 644, 966, 1302, 1638, 1, 429, 1602, 3284, 5300, 7526, 9878, 12300, 1, 1430, 7959, 18423, 31947, 47859, 65619, 84765, 104877, 1, 4862, 43127, 112255, 209500, 331795, 475738, 637657, 813730, 1000135]