Number of rooted ordered trees with n non-root nodes such that all leaf nodes can be k different colors where k is the degree of their parent node.
A384613
Number of rooted ordered trees with n non-root nodes such that all leaf nodes can be k different colors where k is the degree of their parent node.
Terms
- a(0) =1a(1) =1a(2) =5a(3) =36a(4) =340a(5) =4019a(6) =57696a(7) =982146a(8) =19419042a(9) =438068191a(10) =11106513798a(11) =312555754796
External references
- oeis: A384613