21964800

Appears in sequences

• Number of (binary) heaps on n elements.at n=15A056971
• Number of (binary) heaps on n levels (i.e., of 2^n - 1 elements).at n=4A056972
• Number of permutations of {1,2,...,n} that result in a binary search tree with the minimum possible height.at n=14A076615
• Number of permutations of {1,2,...,n} that result in a binary search tree with the minimum possible height.at n=15A076615
• 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=19A244108
• 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=20A244108
• Number A(n,k) of k-ary heaps on n levels; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=25A273712
• Number of (binary) heaps with element set [n] and length n+1.at n=13A373496
• Triangle read by rows: T(n,k) is the number of sequences in which the games of a fully symmetric single-elimination tournament with 2^n teams can be played if arbitrarily many arenas are available and the number of distinct times at which games are played is k, 1 <= k <= 2^n-1.at n=25A380166