A191316 - cp's OEIS frontend

A191316 Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n having k UDU's, where U = (1,1) and D = (1,-1).

n	a(n)
0	1
1	1
2	2
3	3
4	5
5	1
6	8
7	2
8	14
9	5
10	1
11	23
12	10
13	2
14	40
15	23
16	6
17	1
18	67
19	44
20	13
21	2
22	117
23	92
24	35
25	7
26	1
27	198
28	174
29	72
30	16
31	2
32	346
33	350
34	170
35	49
36	8
37	1
38	590
39	654
40	345
41	106
42	19
43	2
44	1032
45	1280
46	768
47	277
48	65
49	9
50	1
51	1769
52	2374
53	1530
54	592
55	146
56	22
57	2
58	3096
59	4564
60	3263
61	1436
62	417
63	83
64	10
65	1
66	5328
67	8414
68	6417
69	3004
70	928
71	192
72	25
73	2

[1, 1, 2, 3, 5, 1, 8, 2, 14, 5, 1, 23, 10, 2, 40, 23, 6, 1, 67, 44, 13, 2, 117, 92, 35, 7, 1, 198, 174, 72, 16, 2, 346, 350, 170, 49, 8, 1, 590, 654, 345, 106, 19, 2, 1032, 1280, 768, 277, 65, 9, 1, 1769, 2374, 1530, 592, 146, 22, 2, 3096, 4564, 3263, 1436, 417, 83, 10, 1, 5328, 8414, 6417, 3004, 928, 192, 25, 2]

cp's OEIS Frontend

A191316 Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n having k UDU's, where U = (1,1) and D = (1,-1).

Table of values

List of values