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.

A373766 Triangle read by rows, T(n,k) with n,k > 1, is the number of subsequences of length k over all permutations of [n], which are neither increasing or decreasing.

Table of values

n a(n)
2 0
3 0
4 4
5 0
6 64
7 22
8 0
9 800
10 550
11 118
12 0
13 9600
14 9900
15 4248
16 718
17 0
18 117600
19 161700
20 104076
21 35182
22 5038
23 0
24 1505280
25 2587200
26 2220288
27 1125824
28 322432
29 40318
30 0
31 20321280
32 41912640
33 44960832
34 30397248
35 13058496
36 3265758
37 362878
38 0
39 290304000
40 698544000
41 899216640
42 759931200
43 435283200

List of values

[0, 0, 4, 0, 64, 22, 0, 800, 550, 118, 0, 9600, 9900, 4248, 718, 0, 117600, 161700, 104076, 35182, 5038, 0, 1505280, 2587200, 2220288, 1125824, 322432, 40318, 0, 20321280, 41912640, 44960832, 30397248, 13058496, 3265758, 362878, 0, 290304000, 698544000, 899216640, 759931200, 435283200]