A372014 - cp's OEIS frontend

A372014 T(n,k) is the total number of levels in all Motzkin paths of length n containing exactly k path nodes; triangle T(n,k), n>=0, 1<=k<=n+1, read by rows.

n	a(n)
0	1
1	0
2	1
3	1
4	1
5	1
6	2
7	2
8	2
9	1
10	4
11	6
12	4
13	3
14	1
15	8
16	14
17	12
18	7
19	4
20	1
21	18
22	32
23	33
24	21
25	11
26	5
27	1
28	44
29	74
30	84
31	64
32	34
33	16
34	6
35	1
36	113
37	180
38	208
39	181
40	111
41	52
42	22
43	7
44	1
45	296
46	457
47	520
48	485
49	344
50	179
51	76
52	29
53	8
54	1
55	782
56	1195
57	1334
58	1273
59	1000
60	599
61	274
62	107
63	37
64	9
65	1

[1, 0, 1, 1, 1, 1, 2, 2, 2, 1, 4, 6, 4, 3, 1, 8, 14, 12, 7, 4, 1, 18, 32, 33, 21, 11, 5, 1, 44, 74, 84, 64, 34, 16, 6, 1, 113, 180, 208, 181, 111, 52, 22, 7, 1, 296, 457, 520, 485, 344, 179, 76, 29, 8, 1, 782, 1195, 1334, 1273, 1000, 599, 274, 107, 37, 9, 1]

cp's OEIS Frontend

A372014 T(n,k) is the total number of levels in all Motzkin paths of length n containing exactly k path nodes; triangle T(n,k), n>=0, 1<=k<=n+1, read by rows.

Table of values

List of values