Number of permutations of {1,2,...,n} that result in a binary search tree with the minimum possible height.

A076615

Number of permutations of {1,2,...,n} that result in a binary search tree with the minimum possible height.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =2a(4) =16a(5) =40a(6) =80a(7) =80a(8) =11360a(9) =55040a(10) =253440a(11) =1056000a(12) =3801600a(13) =10982400a(14) =21964800a(15) =21964800a(16) =857213660160

External references