A126191 - cp's OEIS frontend

A126191 Triangle read by rows: number of 0-1-2 trees (i.e., ordered trees with vertices of outdegrees 0, 1, or 2) with n edges and exactly k vertices that have 2 children, both being leaves (n >= 0, 0 <= k <= floor((n+2)/4)).

n	a(n)
0	1
1	1
2	1
3	1
4	3
5	1
6	6
7	3
8	14
9	7
10	33
11	17
12	1
13	79
14	45
15	3
16	194
17	117
18	12
19	482
20	313
21	40
22	1214
23	843
24	129
25	2
26	3090
27	2287
28	411
29	10
30	7936
31	6247
32	1278
33	50
34	20544
35	17139
36	3942
37	210
38	53545
39	47219
40	12045
41	820
42	5
43	140399
44	130527
45	36559
46	3052
47	35
48	370098
49	361851
50	110388

[1, 1, 1, 1, 3, 1, 6, 3, 14, 7, 33, 17, 1, 79, 45, 3, 194, 117, 12, 482, 313, 40, 1214, 843, 129, 2, 3090, 2287, 411, 10, 7936, 6247, 1278, 50, 20544, 17139, 3942, 210, 53545, 47219, 12045, 820, 5, 140399, 130527, 36559, 3052, 35, 370098, 361851, 110388]

cp's OEIS Frontend

A126191 Triangle read by rows: number of 0-1-2 trees (i.e., ordered trees with vertices of outdegrees 0, 1, or 2) with n edges and exactly k vertices that have 2 children, both being leaves (n >= 0, 0 <= k <= floor((n+2)/4)).

Table of values

List of values