A259703 - cp's OEIS frontend

A259703 Triangle read by rows: T(n,k) = number of permutations without overlaps in which the first increasing run has length k.

n	a(n)
2	1
3	1
4	1
5	2
6	1
7	1
8	5
9	2
10	2
11	1
12	12
13	5
14	4
15	2
16	1
17	33
18	13
19	12
20	4
21	3
22	1
23	87
24	35
25	30
26	12
27	6
28	3
29	1
30	252
31	98
32	90
33	32
34	21
35	6
36	4
37	1
38	703
39	278
40	243
41	94
42	54
43	21
44	8
45	4
46	1
47	2105
48	812
49	745
50	270
51	175
52	57
53	32
54	8
55	5
56	1
57	6099
58	2385
59	2108
60	808
61	485
62	181
63	84
64	32
65	10
66	5
67	1

[1, 1, 1, 2, 1, 1, 5, 2, 2, 1, 12, 5, 4, 2, 1, 33, 13, 12, 4, 3, 1, 87, 35, 30, 12, 6, 3, 1, 252, 98, 90, 32, 21, 6, 4, 1, 703, 278, 243, 94, 54, 21, 8, 4, 1, 2105, 812, 745, 270, 175, 57, 32, 8, 5, 1, 6099, 2385, 2108, 808, 485, 181, 84, 32, 10, 5, 1]

cp's OEIS Frontend

A259703 Triangle read by rows: T(n,k) = number of permutations without overlaps in which the first increasing run has length k.

Table of values

List of values