A126218 - cp's OEIS frontend

A126218 Triangle read by rows: T(n,k) is the number of 0-1-2 trees (i.e., ordered trees with all vertices of outdegree at most two) with n edges and k pairs of adjacent vertices of outdegree 2.

n	a(n)
0	1
1	1
2	2
3	4
4	7
5	2
6	13
7	8
8	26
9	20
10	5
11	52
12	50
13	25
14	104
15	130
16	75
17	14
18	212
19	322
20	217
21	84
22	438
23	770
24	644
25	294
26	42
27	910
28	1836
29	1806
30	952
31	294
32	1903
33	4362
34	4830
35	3108
36	1176
37	132
38	4009
39	10268
40	12738
41	9576
42	4188
43	1056
44	8494
45	24032
46	33219
47	27948
48	14760
49	4752
50	429
51	18080

[1, 1, 2, 4, 7, 2, 13, 8, 26, 20, 5, 52, 50, 25, 104, 130, 75, 14, 212, 322, 217, 84, 438, 770, 644, 294, 42, 910, 1836, 1806, 952, 294, 1903, 4362, 4830, 3108, 1176, 132, 4009, 10268, 12738, 9576, 4188, 1056, 8494, 24032, 33219, 27948, 14760, 4752, 429, 18080]

cp's OEIS Frontend

A126218 Triangle read by rows: T(n,k) is the number of 0-1-2 trees (i.e., ordered trees with all vertices of outdegree at most two) with n edges and k pairs of adjacent vertices of outdegree 2.

Table of values

List of values