Triangle read by rows: T(n,k) is the number of ordered trees with n edges, with thinning limbs and with root of degree k (1<=k<=n). An ordered tree with thinning limbs is such that if a node has k children, all its children have at most k children.
A124328
Triangle read by rows: T(n,k) is the number of ordered trees with n edges, with thinning limbs and with root of degree k (1<=k<=n). An ordered 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) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =5a(8) =3a(9) =1a(10) =1a(11) =10a(12) =9a(13) =4a(14) =1a(15) =1a(16) =22a(17) =25a(18) =14a(19) =5a(20) =1a(21) =1a(22) =46a(23) =69a(24) =44a(25) =20a(26) =6a(27) =1a(28) =1a(29) =101
External references
- oeis: A124328