A259701 - cp's OEIS frontend

A259701 Triangle read by rows: T(n,k) = number of permutations without overlaps in which the first increasing run has length k and the second element is not 2.

n	a(n)
2	0
3	1
4	0
5	2
6	0
7	0
8	5
9	0
10	1
11	0
12	12
13	0
14	2
15	0
16	0
17	33
18	1
19	7
20	0
21	1
22	0
23	87
24	2
25	17
26	0
27	2
28	0
29	0
30	252
31	11
32	55
33	2
34	9
35	0
36	1
37	0
38	703
39	26
40	145
41	4
42	22
43	0
44	2
45	0
46	0
47	2105
48	109
49	467
50	27
51	81
52	3
53	11
54	0
55	1
56	0
57	6099
58	280
59	1296
60	63
61	215
62	6
63	27
64	0
65	2
66	0
67	0

[0, 1, 0, 2, 0, 0, 5, 0, 1, 0, 12, 0, 2, 0, 0, 33, 1, 7, 0, 1, 0, 87, 2, 17, 0, 2, 0, 0, 252, 11, 55, 2, 9, 0, 1, 0, 703, 26, 145, 4, 22, 0, 2, 0, 0, 2105, 109, 467, 27, 81, 3, 11, 0, 1, 0, 6099, 280, 1296, 63, 215, 6, 27, 0, 2, 0, 0]

cp's OEIS Frontend

A259701 Triangle read by rows: T(n,k) = number of permutations without overlaps in which the first increasing run has length k and the second element is not 2.

Table of values

List of values