A259698 - cp's OEIS frontend

A259698 Triangle read by rows: T(n,k) = number of permutations without overlaps having k increasing runs.

n	a(n)
2	1
3	1
4	1
5	1
6	2
7	1
8	1
9	4
10	4
11	1
12	1
13	6
14	10
15	6
16	1
17	1
18	10
19	23
20	22
21	9
22	1
23	1
24	14
25	44
26	61
27	41
28	12
29	1
30	1
31	22
32	87
33	158
34	148
35	71
36	16
37	1
38	1
39	30
40	151
41	352
42	436
43	301
44	114
45	20
46	1
47	1
48	46
49	280
50	791
51	1210
52	1092
53	589
54	175
55	25
56	1
57	1
58	62
59	464
60	1592
61	2969
62	3317
63	2408
64	1038
65	256
66	30
67	1

[1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 6, 10, 6, 1, 1, 10, 23, 22, 9, 1, 1, 14, 44, 61, 41, 12, 1, 1, 22, 87, 158, 148, 71, 16, 1, 1, 30, 151, 352, 436, 301, 114, 20, 1, 1, 46, 280, 791, 1210, 1092, 589, 175, 25, 1, 1, 62, 464, 1592, 2969, 3317, 2408, 1038, 256, 30, 1]

cp's OEIS Frontend

A259698 Triangle read by rows: T(n,k) = number of permutations without overlaps having k increasing runs.

Table of values

List of values