Array read by antidiagonals: T(n,k) is the number of binary rooted trees with n leaves of k colors and all non-leaf nodes having out-degree 2.
A319539
Array read by antidiagonals: T(n,k) is the number of binary rooted trees with n leaves of k colors and all non-leaf nodes having out-degree 2.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =3a(4) =3a(5) =1a(6) =4a(7) =6a(8) =6a(9) =2a(10) =5a(11) =10a(12) =18a(13) =18a(14) =3a(15) =6a(16) =15a(17) =40a(18) =75a(19) =54a(20) =6a(21) =7a(22) =21a(23) =75a(24) =215a(25) =333a(26) =183a(27) =11a(28) =8a(29) =28
External references
- oeis: A319539