Number T(n,k) of permutations of {1,2,...,n} that result in a binary search tree of height k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A195581
Number T(n,k) of permutations of {1,2,...,n} that result in a binary search tree of height k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =2a(6) =0a(7) =0a(8) =2a(9) =4a(10) =0a(11) =0a(12) =0a(13) =16a(14) =8a(15) =0a(16) =0a(17) =0a(18) =40a(19) =64a(20) =16a(21) =0a(22) =0a(23) =0a(24) =80a(25) =400a(26) =208a(27) =32a(28) =0a(29) =0
External references
- oeis: A195581