A114690 - cp's OEIS frontend

A114690 Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/2)).

n	a(n)
1	1
2	2
3	3
4	1
5	5
6	4
7	8
8	12
9	1
10	13
11	31
12	7
13	21
14	73
15	32
16	1
17	34
18	162
19	116
20	11
21	55
22	344
23	365
24	70
25	1
26	89
27	707
28	1041
29	335
30	16
31	144
32	1416
33	2762
34	1340
35	135
36	1
37	233
38	2778
39	6932
40	4726
41	820
42	22
43	377
44	5358
45	16646
46	15176
47	4039
48	238
49	1
50	610
51	10188
52	38560
53	45305
54	17157
55	1785
56	29
57	987

[1, 2, 3, 1, 5, 4, 8, 12, 1, 13, 31, 7, 21, 73, 32, 1, 34, 162, 116, 11, 55, 344, 365, 70, 1, 89, 707, 1041, 335, 16, 144, 1416, 2762, 1340, 135, 1, 233, 2778, 6932, 4726, 820, 22, 377, 5358, 16646, 15176, 4039, 238, 1, 610, 10188, 38560, 45305, 17157, 1785, 29, 987]

cp's OEIS Frontend

A114690 Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/2)).

Table of values

List of values