A065600 - cp's OEIS frontend

A065600 Triangle T(n,k) giving number of Dyck paths of length 2n with exactly k hills (0 <= k <= n).

n	a(n)
0	1
1	0
2	1
3	1
4	0
5	1
6	2
7	2
8	0
9	1
10	6
11	4
12	3
13	0
14	1
15	18
16	13
17	6
18	4
19	0
20	1
21	57
22	40
23	21
24	8
25	5
26	0
27	1
28	186
29	130
30	66
31	30
32	10
33	6
34	0
35	1
36	622
37	432
38	220
39	96
40	40
41	12
42	7
43	0
44	1
45	2120
46	1466
47	744
48	328
49	130
50	51
51	14
52	8
53	0
54	1
55	7338
56	5056
57	2562
58	1128
59	455
60	168
61	63
62	16
63	9
64	0
65	1
66	25724
67	17672
68	8942
69	3941
70	1590
71	602
72	210
73	76
74	18
75	10
76	0
77	1

[1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 6, 4, 3, 0, 1, 18, 13, 6, 4, 0, 1, 57, 40, 21, 8, 5, 0, 1, 186, 130, 66, 30, 10, 6, 0, 1, 622, 432, 220, 96, 40, 12, 7, 0, 1, 2120, 1466, 744, 328, 130, 51, 14, 8, 0, 1, 7338, 5056, 2562, 1128, 455, 168, 63, 16, 9, 0, 1, 25724, 17672, 8942, 3941, 1590, 602, 210, 76, 18, 10, 0, 1]

cp's OEIS Frontend

A065600 Triangle T(n,k) giving number of Dyck paths of length 2n with exactly k hills (0 <= k <= n).

Table of values

List of values