A191306 - cp's OEIS frontend

A191306 Triangle read by rows: T(n,k) is the number of dispersed Dyck paths (i.e., Motzkin paths with no (1,0) steps at positive heights) of length n having height of first peak equal to k.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	2
6	1
7	4
8	1
9	1
10	7
11	2
12	1
13	13
14	5
15	1
16	1
17	23
18	9
19	2
20	1
21	43
22	19
23	6
24	1
25	1
26	78
27	34
28	11
29	2
30	1
31	148
32	69
33	26
34	7
35	1
36	1
37	274
38	125
39	47
40	13
41	2
42	1
43	526
44	251
45	103
46	34
47	8
48	1
49	1
50	988
51	461
52	187
53	62
54	15
55	2
56	1
57	1912
58	923
59	397
60	146
61	43
62	9
63	1
64	1
65	3628
66	1715
67	727
68	266
69	79
70	17
71	2
72	1
73	7060
74	3431
75	1519
76	596
77	199
78	53
79	10
80	1

[1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 7, 2, 1, 13, 5, 1, 1, 23, 9, 2, 1, 43, 19, 6, 1, 1, 78, 34, 11, 2, 1, 148, 69, 26, 7, 1, 1, 274, 125, 47, 13, 2, 1, 526, 251, 103, 34, 8, 1, 1, 988, 461, 187, 62, 15, 2, 1, 1912, 923, 397, 146, 43, 9, 1, 1, 3628, 1715, 727, 266, 79, 17, 2, 1, 7060, 3431, 1519, 596, 199, 53, 10, 1]

cp's OEIS Frontend

A191306 Triangle read by rows: T(n,k) is the number of dispersed Dyck paths (i.e., Motzkin paths with no (1,0) steps at positive heights) of length n having height of first peak equal to k.

Table of values

List of values