Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), k>=0, k<=n<=2^k-1, read by columns.
A335920
Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), k>=0, k<=n<=2^k-1, read by columns.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =6a(6) =6a(7) =4a(8) =1a(9) =8a(10) =20a(11) =40a(12) =68a(13) =94a(14) =114a(15) =116a(16) =94a(17) =60a(18) =28a(19) =8a(20) =1a(21) =16a(22) =56a(23) =152a(24) =376a(25) =844a(26) =1744a(27) =3340a(28) =5976a(29) =10040
External references
- oeis: A335920