10982400

Appears in sequences

• Number of permutations of {1,2,...,n} that result in a binary search tree with the minimum possible height.at n=13A076615
• Number T(n,k) of permutations of {1,2,...,n} that result in a binary search tree of height k; triangle T(n,k), k>=0, k<=n<=2^k-1, read by columns.at n=18A244108