A191384 - cp's OEIS frontend

A191384 Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights) with k ascents of length 1. An ascent is a maximal sequence of consecutive (1,1)-steps.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	2
6	2
7	3
8	1
9	3
10	4
11	3
12	5
13	8
14	6
15	1
16	7
17	14
18	10
19	4
20	12
21	26
22	21
23	10
24	1
25	18
26	42
27	41
28	20
29	5
30	31
31	77
32	83
33	45
34	15
35	1
36	47
37	128
38	150
39	96
40	35
41	6
42	81
43	234
44	293
45	209
46	85
47	21
48	1
49	125
50	388
51	530
52	414
53	196
54	56
55	7
56	216
57	704
58	1023
59	858
60	455
61	147
62	28
63	1
64	337
65	1172
66	1828
67	1668
68	974
69	364
70	84
71	8
72	583
73	2119
74	3479
75	3385
76	2133
77	896
78	238
79	36
80	1

[1, 1, 1, 1, 1, 2, 2, 3, 1, 3, 4, 3, 5, 8, 6, 1, 7, 14, 10, 4, 12, 26, 21, 10, 1, 18, 42, 41, 20, 5, 31, 77, 83, 45, 15, 1, 47, 128, 150, 96, 35, 6, 81, 234, 293, 209, 85, 21, 1, 125, 388, 530, 414, 196, 56, 7, 216, 704, 1023, 858, 455, 147, 28, 1, 337, 1172, 1828, 1668, 974, 364, 84, 8, 583, 2119, 3479, 3385, 2133, 896, 238, 36, 1]

cp's OEIS Frontend

A191384 Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights) with k ascents of length 1. An ascent is a maximal sequence of consecutive (1,1)-steps.

Table of values

List of values