A246188 - cp's OEIS frontend

A246188 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k occurrences of the string ududu, where u=(1,1), d=(1,-1).

n	a(n)
0	1
1	1
2	2
3	4
4	1
5	11
6	2
7	1
8	31
9	8
10	2
11	1
12	92
13	28
14	9
15	2
16	1
17	283
18	99
19	34
20	10
21	2
22	1
23	893
24	354
25	129
26	40
27	11
28	2
29	1
30	2875
31	1273
32	492
33	161
34	46
35	12
36	2
37	1
38	9407
39	4598
40	1882
41	646
42	195
43	52
44	13
45	2
46	1
47	31189
48	16679
49	7199
50	2597
51	816
52	231
53	58
54	14
55	2
56	1
57	104555
58	60712
59	27570
60	10400
61	3422
62	1002
63	269
64	64
65	15
66	2
67	1

[1, 1, 2, 4, 1, 11, 2, 1, 31, 8, 2, 1, 92, 28, 9, 2, 1, 283, 99, 34, 10, 2, 1, 893, 354, 129, 40, 11, 2, 1, 2875, 1273, 492, 161, 46, 12, 2, 1, 9407, 4598, 1882, 646, 195, 52, 13, 2, 1, 31189, 16679, 7199, 2597, 816, 231, 58, 14, 2, 1, 104555, 60712, 27570, 10400, 3422, 1002, 269, 64, 15, 2, 1]

cp's OEIS Frontend

A246188 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k occurrences of the string ududu, where u=(1,1), d=(1,-1).

Table of values

List of values