Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), n>=0, max(0,floor(log_2(n))+1)<=k<=n, read by rows.
A335919
Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), n>=0, max(0,floor(log_2(n))+1)<=k<=n, read by rows.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =6a(6) =8a(7) =6a(8) =20a(9) =16a(10) =4a(11) =40a(12) =56a(13) =32a(14) =1a(15) =68a(16) =152a(17) =144a(18) =64a(19) =94a(20) =376a(21) =480a(22) =352a(23) =128a(24) =114a(25) =844a(26) =1440a(27) =1376a(28) =832a(29) =256
External references
- oeis: A335919