A092594 - cp's OEIS frontend

A092594 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 231-pattern is equal to k.

n	a(n)
1	1
2	0
3	2
4	0
5	2
6	4
7	0
8	8
9	8
10	8
11	0
12	40
13	40
14	24
15	16
16	0
17	240
18	240
19	144
20	64
21	32
22	0
23	1680
24	1680
25	1008
26	448
27	160
28	64
29	0
30	13440
31	13440
32	8064
33	3584
34	1280
35	384
36	128
37	0
38	120960
39	120960
40	72576
41	32256
42	11520
43	3456
44	896
45	256
46	0
47	1209600
48	1209600
49	725760
50	322560
51	115200
52	34560

[1, 0, 2, 0, 2, 4, 0, 8, 8, 8, 0, 40, 40, 24, 16, 0, 240, 240, 144, 64, 32, 0, 1680, 1680, 1008, 448, 160, 64, 0, 13440, 13440, 8064, 3584, 1280, 384, 128, 0, 120960, 120960, 72576, 32256, 11520, 3456, 896, 256, 0, 1209600, 1209600, 725760, 322560, 115200, 34560]

cp's OEIS Frontend

A092594 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 231-pattern is equal to k.

Table of values

List of values