Triangle read by rows: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, n>=0, fibonacci(n+2)<=k<=2^n.
A143897
Triangle read by rows: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, n>=0, fibonacci(n+2)<=k<=2^n.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =6a(6) =4a(7) =1a(8) =16a(9) =32a(10) =44a(11) =60a(12) =70a(13) =56a(14) =28a(15) =8a(16) =1a(17) =128a(18) =448a(19) =864a(20) =1552a(21) =2720a(22) =4288a(23) =6312a(24) =9004a(25) =11992a(26) =14372a(27) =15400a(28) =14630a(29) =11968
External references
- oeis: A143897