Number of 1-2-3-4-5-6 trees with n edges and with thinning limbs. A 1-2-3-4-5-6 tree is an ordered tree with vertices of outdegree at most 6. A rooted tree with thinning limbs is such that if a node has k children, all its children have at most k children.
A124501
Number of 1-2-3-4-5-6 trees with n edges and with thinning limbs. A 1-2-3-4-5-6 tree is an ordered tree with vertices of outdegree at most 6. A rooted tree with thinning limbs is such that if a node has k children, all its children have at most k children.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =4a(4) =10a(5) =25a(6) =68a(7) =186a(8) =522a(9) =1479a(10) =4246a(11) =12289a(12) =35872a(13) =105411a(14) =311662a(15) =926270a(16) =2765778a(17) =8292296a(18) =24953437a(19) =75338686a(20) =228140842a(21) =692733127a(22) =2108652750a(23) =6433255041a(24) =19668210742a(25) =60247367313a(26) =184879648441a(27) =568281131800
External references
- oeis: A124501