A114626 - cp's OEIS frontend

A114626 Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k peaks at level 2; 0<= k<=n-1, n>=2 (a Dyck path is said to be hill-free if it has no peaks at level 1).

n	a(n)
2	0
3	1
4	1
5	0
6	1
7	2
8	2
9	1
10	1
11	6
12	6
13	3
14	2
15	1
16	19
17	17
18	12
19	5
20	3
21	1
22	61
23	56
24	36
25	20
26	8
27	4
28	1
29	202
30	185
31	120
32	66
33	31
34	12
35	5
36	1
37	683
38	624
39	409
40	224
41	110
42	46
43	17
44	6
45	1
46	2348
47	2144
48	1408
49	784
50	385
51	172
52	66
53	23
54	7
55	1
56	8184
57	7468
58	4920
59	2760
60	1380
61	624
62	257
63	92
64	30
65	8
66	1
67	28855
68	26317

[0, 1, 1, 0, 1, 2, 2, 1, 1, 6, 6, 3, 2, 1, 19, 17, 12, 5, 3, 1, 61, 56, 36, 20, 8, 4, 1, 202, 185, 120, 66, 31, 12, 5, 1, 683, 624, 409, 224, 110, 46, 17, 6, 1, 2348, 2144, 1408, 784, 385, 172, 66, 23, 7, 1, 8184, 7468, 4920, 2760, 1380, 624, 257, 92, 30, 8, 1, 28855, 26317]

cp's OEIS Frontend

A114626 Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k peaks at level 2; 0<= k<=n-1, n>=2 (a Dyck path is said to be hill-free if it has no peaks at level 1).

Table of values

List of values