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.

A197365 T(n,k) gives the number of permutations of the set [n] that contain k occurrences of the subword (132); irregular array read by rows (n >= 0 and 0 <= k <= max(0, floor((n-1)/2))).

Table of values

n a(n)
0 1
1 1
2 2
3 5
4 1
5 16
6 8
7 63
8 54
9 3
10 296
11 368
12 56
13 1623
14 2649
15 753
16 15
17 10176
18 20544
19 9024
20 576
21 71793
22 172596
23 104814
24 13572
25 105
26 562848
27 1569408
28 1228608
29 259968
30 7968
31 4853949
32 15398829
33 14824314
34 4532034
35 306729
36 945
37 45664896
38 162412416
39 185991936
40 75929856

List of values

[1, 1, 2, 5, 1, 16, 8, 63, 54, 3, 296, 368, 56, 1623, 2649, 753, 15, 10176, 20544, 9024, 576, 71793, 172596, 104814, 13572, 105, 562848, 1569408, 1228608, 259968, 7968, 4853949, 15398829, 14824314, 4532034, 306729, 945, 45664896, 162412416, 185991936, 75929856]