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.

A226441 T(n,k) = number of permutations of {1..n} with fewer than k interior elements having values lying between the values of their neighbors.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 4
7 1
8 2
9 6
10 10
11 1
12 2
13 6
14 22
15 32
16 1
17 2
18 6
19 24
20 90
21 122
22 1
23 2
24 6
25 24
26 118
27 422
28 544
29 1
30 2
31 6
32 24
33 120
34 658
35 2226
36 2770
37 1
38 2
39 6
40 24
41 120
42 718
43 4078
44 13102
45 15872
46 1
47 2
48 6
49 24
50 120
51 720
52 4914
53 27724
54 85170
55 101042
56 1
57 2
58 6
59 24
60 120
61 720
62 5038
63 37300
64 205134
65 606542
66 707584

List of values

[1, 1, 2, 1, 2, 4, 1, 2, 6, 10, 1, 2, 6, 22, 32, 1, 2, 6, 24, 90, 122, 1, 2, 6, 24, 118, 422, 544, 1, 2, 6, 24, 120, 658, 2226, 2770, 1, 2, 6, 24, 120, 718, 4078, 13102, 15872, 1, 2, 6, 24, 120, 720, 4914, 27724, 85170, 101042, 1, 2, 6, 24, 120, 720, 5038, 37300, 205134, 606542, 707584]