A288387 - cp's OEIS frontend

A288387 Number T(n,k) of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

n	a(n)
0	1
1	0
2	1
3	1
4	0
5	1
6	2
7	2
8	0
9	1
10	8
11	5
12	0
13	0
14	1
15	25
16	13
17	3
18	0
19	0
20	1
21	83
22	35
23	13
24	0
25	0
26	0
27	1
28	282
29	112
30	30
31	4
32	0
33	0
34	0
35	1
36	971
37	368
38	61
39	29
40	0
41	0
42	0
43	0
44	1
45	3386
46	1208
47	172
48	90
49	5
50	0
51	0
52	0
53	0
54	1
55	11940
56	3992
57	619
58	188
59	56
60	0
61	0
62	0
63	0
64	0
65	1
66	42504
67	13449
68	2241
69	345
70	240
71	6
72	0
73	0
74	0
75	0
76	0
77	1

[1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 8, 5, 0, 0, 1, 25, 13, 3, 0, 0, 1, 83, 35, 13, 0, 0, 0, 1, 282, 112, 30, 4, 0, 0, 0, 1, 971, 368, 61, 29, 0, 0, 0, 0, 1, 3386, 1208, 172, 90, 5, 0, 0, 0, 0, 1, 11940, 3992, 619, 188, 56, 0, 0, 0, 0, 0, 1, 42504, 13449, 2241, 345, 240, 6, 0, 0, 0, 0, 0, 1]

cp's OEIS Frontend

A288387 Number T(n,k) of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values