A166293 - cp's OEIS frontend

A166293 Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n and having k peaks at even level (0<=k<=n-1; U=(1,1), D=(1,-1)).

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	3
9	3
10	1
11	1
12	4
13	7
14	4
15	1
16	1
17	5
18	13
19	12
20	5
21	1
22	1
23	6
24	22
25	28
26	18
27	6
28	1
29	1
30	7
31	35
32	59
33	50
34	25
35	7
36	1
37	1
38	8
39	54
40	114
41	124
42	80
43	33
44	8
45	1
46	1
47	9
48	82
49	210
50	279
51	226
52	119
53	42
54	9
55	1
56	1
57	10
58	124
59	374
60	592
61	576
62	375
63	168
64	52
65	10
66	1
67	1
68	11
69	188
70	653
71	1199
72	1374
73	1062
74	582
75	228
76	63

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 7, 4, 1, 1, 5, 13, 12, 5, 1, 1, 6, 22, 28, 18, 6, 1, 1, 7, 35, 59, 50, 25, 7, 1, 1, 8, 54, 114, 124, 80, 33, 8, 1, 1, 9, 82, 210, 279, 226, 119, 42, 9, 1, 1, 10, 124, 374, 592, 576, 375, 168, 52, 10, 1, 1, 11, 188, 653, 1199, 1374, 1062, 582, 228, 63]

cp's OEIS Frontend

A166293 Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n and having k peaks at even level (0<=k<=n-1; U=(1,1), D=(1,-1)).

Table of values

List of values