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).

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).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =4a(7) =2a(8) =9a(9) =3a(10) =20a(11) =6a(12) =46a(13) =11a(14) =106a(15) =23a(16) =248a(17) =46a(18) =582a(19) =98a(20) =1376a(21) =207a(22) =3264a(23) =451a(24) =7777a(25) =983a(26) =18581a(27) =2179a(28) =44526a(29) =4850

External references