A126219 - cp's OEIS frontend

A126219 Triangle read by rows: T(n,k) is the number of binary trees (i.e., a rooted tree where each vertex has either 0, 1, or 2 children; and, when only one child is present, it is either a right child or a left child) with n edges and k pairs of adjacent vertices of outdegree 2.

n	a(n)
0	1
1	2
2	5
3	14
4	40
5	2
6	116
7	16
8	344
9	80
10	5
11	1040
12	340
13	50
14	3188
15	1360
16	300
17	14
18	9880
19	5264
20	1484
21	168
22	30912
23	19880
24	6776
25	1176
26	42
27	97520
28	73728
29	29568
30	6608
31	588
32	309856
33	269952
34	124656
35	33600
36	4704
37	132
38	990656
39	979264
40	511584
41	161280
42	29544
43	2112

[1, 2, 5, 14, 40, 2, 116, 16, 344, 80, 5, 1040, 340, 50, 3188, 1360, 300, 14, 9880, 5264, 1484, 168, 30912, 19880, 6776, 1176, 42, 97520, 73728, 29568, 6608, 588, 309856, 269952, 124656, 33600, 4704, 132, 990656, 979264, 511584, 161280, 29544, 2112]

cp's OEIS Frontend

A126219 Triangle read by rows: T(n,k) is the number of binary trees (i.e., a rooted tree where each vertex has either 0, 1, or 2 children; and, when only one child is present, it is either a right child or a left child) with n edges and k pairs of adjacent vertices of outdegree 2.

Table of values

List of values