A114586 - cp's OEIS frontend

A114586 Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k peaks at odd levels (0<=k<=n-2; n>=2). A hill in a Dyck path is a peak at level 1.

n	a(n)
2	1
3	1
4	1
5	3
6	2
7	1
8	6
9	8
10	3
11	1
12	15
13	22
14	15
15	4
16	1
17	36
18	68
19	52
20	24
21	5
22	1
23	91
24	198
25	191
26	100
27	35
28	6
29	1
30	232
31	586
32	651
33	425
34	170
35	48
36	7
37	1
38	603
39	1718
40	2203
41	1656
42	820
43	266
44	63
45	8
46	1
47	1585
48	5047
49	7285
50	6299
51	3591
52	1435
53	392
54	80
55	9
56	1
57	4213
58	14808
59	23832
60	23164
61	15155
62	6972
63	2338

[1, 1, 1, 3, 2, 1, 6, 8, 3, 1, 15, 22, 15, 4, 1, 36, 68, 52, 24, 5, 1, 91, 198, 191, 100, 35, 6, 1, 232, 586, 651, 425, 170, 48, 7, 1, 603, 1718, 2203, 1656, 820, 266, 63, 8, 1, 1585, 5047, 7285, 6299, 3591, 1435, 392, 80, 9, 1, 4213, 14808, 23832, 23164, 15155, 6972, 2338]

cp's OEIS Frontend

A114586 Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k peaks at odd levels (0<=k<=n-2; n>=2). A hill in a Dyck path is a peak at level 1.

Table of values

List of values