Number of 1-2-3-4-5 trees with n edges and with thinning limbs. A 1-2-3-4-5 tree is an ordered tree with vertices of outdegree at most 5. A rooted tree with thinning limbs is such that if a node has k children, all its children have at most k children.
A124500
Number of 1-2-3-4-5 trees with n edges and with thinning limbs. A 1-2-3-4-5 tree is an ordered tree with vertices of outdegree at most 5. 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) =67a(7) =180a(8) =495a(9) =1375a(10) =3871a(11) =10993a(12) =31493a(13) =90843a(14) =263686a(15) =769466a(16) =2256135a(17) =6643082a(18) =19634705a(19) =58232350a(20) =173242381a(21) =516860717a(22) =1546035258a(23) =4635543843a(24) =13929569399a(25) =41943013047a(26) =126532961332a(27) =382396277940
External references
- oeis: A124500