Triangle read by rows: T(n,k) is the number of trees with n leaves of exactly k colors and all non-leaf nodes having degree 3.
A339650
Triangle read by rows: T(n,k) is the number of trees with n leaves of exactly k colors and all non-leaf nodes having degree 3.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =2a(9) =1a(10) =0a(11) =1a(12) =4a(13) =6a(14) =3a(15) =0a(16) =1a(17) =10a(18) =30a(19) =36a(20) =15a(21) =0a(22) =2a(23) =27a(24) =140a(25) =310a(26) =300a(27) =105a(28) =0a(29) =2
External references
- oeis: A339650