A114506 - cp's OEIS frontend

A114506 Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 3 (0<=k<=floor(n/3)). Also number of ordered trees with n edges that have k vertices of outdegree 3.

n	a(n)
0	1
1	1
2	2
3	4
4	1
5	10
6	4
7	27
8	15
9	79
10	50
11	3
12	240
13	168
14	21
15	750
16	568
17	112
18	2387
19	1959
20	504
21	12
22	7711
23	6850
24	2115
25	120
26	25214
27	24211
28	8536
29	825
30	83315
31	86164
32	33858
33	4620
34	55
35	277799
36	308152
37	133068
38	23166
39	715
40	933596
41	1106028
42	520338
43	108472
44	6006

[1, 1, 2, 4, 1, 10, 4, 27, 15, 79, 50, 3, 240, 168, 21, 750, 568, 112, 2387, 1959, 504, 12, 7711, 6850, 2115, 120, 25214, 24211, 8536, 825, 83315, 86164, 33858, 4620, 55, 277799, 308152, 133068, 23166, 715, 933596, 1106028, 520338, 108472, 6006]

cp's OEIS Frontend

A114506 Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 3 (0<=k<=floor(n/3)). Also number of ordered trees with n edges that have k vertices of outdegree 3.

Table of values

List of values