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.

A092583 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 the 123-pattern is equal to k.

Table of values

n a(n)
1 1
2 0
3 2
4 0
5 1
6 5
7 0
8 4
9 6
10 14
11 0
12 20
13 30
14 28
15 42
16 0
17 120
18 180
19 168
20 120
21 132
22 0
23 840
24 1260
25 1176
26 840
27 495
28 429
29 0
30 6720
31 10080
32 9408
33 6720
34 3960
35 2002
36 1430
37 0
38 60480
39 90720
40 84672
41 60480
42 35640
43 18018
44 8008
45 4862
46 0
47 604800
48 907200
49 846720
50 604800
51 356400
52 180180
53 80080
54 31824
55 16796

List of values

[1, 0, 2, 0, 1, 5, 0, 4, 6, 14, 0, 20, 30, 28, 42, 0, 120, 180, 168, 120, 132, 0, 840, 1260, 1176, 840, 495, 429, 0, 6720, 10080, 9408, 6720, 3960, 2002, 1430, 0, 60480, 90720, 84672, 60480, 35640, 18018, 8008, 4862, 0, 604800, 907200, 846720, 604800, 356400, 180180, 80080, 31824, 16796]