Triangle read by rows: T(n,k) is the number of binary rooted trees with n leaves of exactly k colors and all non-leaf nodes having out-degree 2.

A319541

Triangle read by rows: T(n,k) is the number of binary rooted trees with n leaves of exactly k colors and all non-leaf nodes having out-degree 2.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =3a(6) =2a(7) =14a(8) =27a(9) =15a(10) =3a(11) =48a(12) =180a(13) =240a(14) =105a(15) =6a(16) =171a(17) =1089a(18) =2604a(19) =2625a(20) =945a(21) =11a(22) =614a(23) =6333a(24) =24180a(25) =42075a(26) =34020a(27) =10395a(28) =23a(29) =2270

External references