A114580 - cp's OEIS frontend

A114580 Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	3
6	1
7	7
8	1
9	1
10	14
11	6
12	1
13	26
14	23
15	1
16	1
17	46
18	70
19	10
20	1
21	79
22	186
23	56
24	1
25	1
26	133
27	451
28	235
29	15
30	1
31	221
32	1025
33	825
34	115
35	1
36	1
37	364
38	2220
39	2562
40	630
41	21
42	1
43	596
44	4634
45	7274
46	2794
47	211
48	1
49	1
50	972
51	9396
52	19286
53	10696
54	1456
55	28
56	1
57	1581
58	18612
59	48450
60	36715

[1, 1, 1, 1, 1, 3, 1, 7, 1, 1, 14, 6, 1, 26, 23, 1, 1, 46, 70, 10, 1, 79, 186, 56, 1, 1, 133, 451, 235, 15, 1, 221, 1025, 825, 115, 1, 1, 364, 2220, 2562, 630, 21, 1, 596, 4634, 7274, 2794, 211, 1, 1, 972, 9396, 19286, 10696, 1456, 28, 1, 1581, 18612, 48450, 36715]

cp's OEIS Frontend

A114580 Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps.

Table of values

List of values