A110952 - cp's OEIS frontend

A110952 Triangle read by rows: T(n,k) = number of permutations of [n] where the first increasing run has length k and the last increasing run has length n-k-1, 0

n	a(n)
3	1
4	3
5	3
6	6
7	11
8	6
9	10
10	26
11	26
12	10
13	15
14	50
15	71
16	50
17	15
18	21
19	85
20	155
21	155
22	85
23	21
24	28
25	133
26	295
27	379
28	295
29	133
30	28
31	36
32	196
33	511
34	799
35	799
36	511
37	196
38	36
39	45
40	276
41	826
42	1519
43	1849
44	1519
45	826
46	276
47	45
48	55
49	375
50	1266
51	2674
52	3829
53	3829
54	2674
55	1266
56	375
57	55
58	66
59	495
60	1860

[1, 3, 3, 6, 11, 6, 10, 26, 26, 10, 15, 50, 71, 50, 15, 21, 85, 155, 155, 85, 21, 28, 133, 295, 379, 295, 133, 28, 36, 196, 511, 799, 799, 511, 196, 36, 45, 276, 826, 1519, 1849, 1519, 826, 276, 45, 55, 375, 1266, 2674, 3829, 3829, 2674, 1266, 375, 55, 66, 495, 1860]

cp's OEIS Frontend

A110952 Triangle read by rows: T(n,k) = number of permutations of [n] where the first increasing run has length k and the last increasing run has length n-k-1, 0

Table of values

List of values