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.

A010027 Triangle read by rows: T(n,k) is the number of permutations of [n] having k consecutive ascending pairs (0 <= k <= n-1).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 3
7 1
8 3
9 9
10 11
11 1
12 4
13 18
14 44
15 53
16 1
17 5
18 30
19 110
20 265
21 309
22 1
23 6
24 45
25 220
26 795
27 1854
28 2119
29 1
30 7
31 63
32 385
33 1855
34 6489
35 14833
36 16687
37 1
38 8
39 84
40 616
41 3710
42 17304
43 59332
44 133496
45 148329
46 1
47 9
48 108
49 924
50 6678
51 38934
52 177996
53 600732
54 1334961
55 1468457
56 1

List of values

[1, 1, 1, 1, 2, 3, 1, 3, 9, 11, 1, 4, 18, 44, 53, 1, 5, 30, 110, 265, 309, 1, 6, 45, 220, 795, 1854, 2119, 1, 7, 63, 385, 1855, 6489, 14833, 16687, 1, 8, 84, 616, 3710, 17304, 59332, 133496, 148329, 1, 9, 108, 924, 6678, 38934, 177996, 600732, 1334961, 1468457, 1]