Limit of the number of (unlabeled) rooted trees without unary nodes where n is the difference between the number of leafs and the maximal outdegree as the tree size increases.
A292087
Limit of the number of (unlabeled) rooted trees without unary nodes where n is the difference between the number of leafs and the maximal outdegree as the tree size increases.
Terms
- a(0) =1a(1) =2a(2) =7a(3) =23a(4) =78a(5) =262a(6) =893a(7) =3040a(8) =10411a(9) =35724a(10) =122950a(11) =424004a(12) =1465254a(13) =5071981a(14) =17584226a(15) =61046464a(16) =212197118a(17) =738422362a(18) =2572261241a(19) =8968726829a(20) =31298189180a(21) =109307655964a(22) =382031357974
External references
- oeis: A292087