Triangle read by rows: T(n,k) is the number of ordered trees with n edges and jump-length equal to k (n >= 0, 0 <= k <= n-2).
A127529
Triangle read by rows: T(n,k) is the number of ordered trees with n edges and jump-length equal to k (n >= 0, 0 <= k <= n-2).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =4a(4) =1a(5) =8a(6) =5a(7) =1a(8) =16a(9) =17a(10) =8a(11) =1a(12) =32a(13) =49a(14) =38a(15) =12a(16) =1a(17) =64a(18) =129a(19) =141a(20) =77a(21) =17a(22) =1a(23) =128a(24) =321a(25) =453a(26) =361a(27) =143a(28) =23a(29) =1
External references
- oeis: A127529