A166288 - cp's OEIS frontend

A166288 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 UDUD's (0<=k <= n-1; U=(1,1), D=(1,-1)).

n	a(n)
1	1
2	1
3	1
4	2
5	1
6	1
7	2
8	4
9	1
10	1
11	4
12	5
13	6
14	1
15	1
16	6
17	12
18	9
19	8
20	1
21	1
22	9
23	23
24	24
25	14
26	10
27	1
28	1
29	17
30	38
31	56
32	40
33	20
34	12
35	1
36	1
37	26
38	84
39	100
40	110
41	60
42	27
43	14
44	1
45	1
46	46
47	145
48	250
49	210
50	190
51	84
52	35
53	16
54	1
55	1
56	81
57	280
58	480
59	580
60	385
61	301
62	112
63	44
64	18
65	1
66	1
67	135
68	551
69	995
70	1225
71	1155
72	644
73	448
74	144
75	54
76	20
77	1
78	1

[1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 4, 5, 6, 1, 1, 6, 12, 9, 8, 1, 1, 9, 23, 24, 14, 10, 1, 1, 17, 38, 56, 40, 20, 12, 1, 1, 26, 84, 100, 110, 60, 27, 14, 1, 1, 46, 145, 250, 210, 190, 84, 35, 16, 1, 1, 81, 280, 480, 580, 385, 301, 112, 44, 18, 1, 1, 135, 551, 995, 1225, 1155, 644, 448, 144, 54, 20, 1, 1]

cp's OEIS Frontend

A166288 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 UDUD's (0<=k <= n-1; U=(1,1), D=(1,-1)).

Table of values

List of values