A344613 - cp's OEIS frontend

A344613 Number of rooted binary trees (in which all inner nodes have precisely two children) with n leaves and with maximal number of cherries (i.e., maximal number of pendant subtrees with two leaves).

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	4
8	2
9	9
10	3
11	20
12	6
13	46
14	11
15	106
16	23
17	248
18	46
19	582
20	98
21	1376
22	207
23	3264
24	451
25	7777
26	983
27	18581
28	2179
29	44526
30	4850
31	106936
32	10905
33	257379
34	24631
35	620577
36	56011
37	1498788
38	127912
39	3625026
40	293547
41	8779271
42	676157
43	21287278
44	1563372
45	51671864
46	3626149
47	125550018

[1, 1, 1, 1, 2, 1, 4, 2, 9, 3, 20, 6, 46, 11, 106, 23, 248, 46, 582, 98, 1376, 207, 3264, 451, 7777, 983, 18581, 2179, 44526, 4850, 106936, 10905, 257379, 24631, 620577, 56011, 1498788, 127912, 3625026, 293547, 8779271, 676157, 21287278, 1563372, 51671864, 3626149, 125550018]

cp's OEIS Frontend

A344613 Number of rooted binary trees (in which all inner nodes have precisely two children) with n leaves and with maximal number of cherries (i.e., maximal number of pendant subtrees with two leaves).

Table of values

List of values