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.

A008971 Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 5
6 1
7 18
8 5
9 1
10 58
11 61
12 1
13 179
14 479
15 61
16 1
17 543
18 3111
19 1385
20 1
21 1636
22 18270
23 19028
24 1385
25 1
26 4916
27 101166
28 206276
29 50521
30 1
31 14757
32 540242
33 1949762
34 1073517
35 50521
36 1
37 44281
38 2819266
39 16889786
40 17460701
41 2702765
42 1
43 132854
44 14494859

List of values

[1, 1, 1, 1, 1, 5, 1, 18, 5, 1, 58, 61, 1, 179, 479, 61, 1, 543, 3111, 1385, 1, 1636, 18270, 19028, 1385, 1, 4916, 101166, 206276, 50521, 1, 14757, 540242, 1949762, 1073517, 50521, 1, 44281, 2819266, 16889786, 17460701, 2702765, 1, 132854, 14494859]