55040

Appears in sequences

• Number of permutations of {1,2,...,n} that result in a binary search tree with the minimum possible height.at n=9A076615
• a(n) is the sum of all possible pairs of the first n primes.at n=30A162867
• Triangular array: (1/2)*A193846.at n=39A193848
• Triangular array: (1/2)*A193847.at n=41A193849
• 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.at n=49A195581
• 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=14A244108