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.

A092741 Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding both the 132- and the 321-pattern is equal to k.

Table of values

n a(n)
1 1
2 0
3 2
4 0
5 2
6 4
7 0
8 8
9 9
10 7
11 0
12 40
13 45
14 24
15 11
16 0
17 240
18 270
19 144
20 50
21 16
22 0
23 1680
24 1890
25 1008
26 350
27 90
28 22
29 0
30 13440
31 15120
32 8064
33 2800
34 720
35 147
36 29
37 0
38 120960
39 136080
40 72576
41 25200
42 6480
43 1323
44 224
45 37
46 0
47 1209600
48 1360800
49 725760
50 252000
51 64800
52 13230

List of values

[1, 0, 2, 0, 2, 4, 0, 8, 9, 7, 0, 40, 45, 24, 11, 0, 240, 270, 144, 50, 16, 0, 1680, 1890, 1008, 350, 90, 22, 0, 13440, 15120, 8064, 2800, 720, 147, 29, 0, 120960, 136080, 72576, 25200, 6480, 1323, 224, 37, 0, 1209600, 1360800, 725760, 252000, 64800, 13230]