A371928 - cp's OEIS frontend

A371928 T(n,k) is the total number of levels in all Dyck paths of semilength 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	1
2	1
3	1
4	3
5	1
6	3
7	5
8	6
9	1
10	8
11	15
12	13
13	11
14	1
15	23
16	44
17	43
18	29
19	20
20	1
21	71
22	134
23	138
24	106
25	62
26	37
27	1
28	229
29	427
30	446
31	371
32	248
33	132
34	70
35	1
36	759
37	1408
38	1478
39	1275
40	941
41	571
42	283
43	135
44	1
45	2566
46	4753
47	5017
48	4410
49	3437
50	2331
51	1310
52	611
53	264
54	1
55	8817
56	16321
57	17339
58	15458
59	12426
60	9027
61	5709
62	3002
63	1324
64	521
65	1

[1, 1, 1, 1, 3, 1, 3, 5, 6, 1, 8, 15, 13, 11, 1, 23, 44, 43, 29, 20, 1, 71, 134, 138, 106, 62, 37, 1, 229, 427, 446, 371, 248, 132, 70, 1, 759, 1408, 1478, 1275, 941, 571, 283, 135, 1, 2566, 4753, 5017, 4410, 3437, 2331, 1310, 611, 264, 1, 8817, 16321, 17339, 15458, 12426, 9027, 5709, 3002, 1324, 521, 1]

cp's OEIS Frontend

A371928 T(n,k) is the total number of levels in all Dyck paths of semilength 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