A076615 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	2
3	2
4	16
5	40
6	80
7	80
8	11360
9	55040
10	253440
11	1056000
12	3801600
13	10982400
14	21964800
15	21964800
16	857213660160
17	7907423180800
18	72155129446400
19	645950912921600
20	5622693241651200
21	47110389109555200
22	375570435981312000
23	2811021970538496000
24	19445103757787136000

[1, 1, 2, 2, 16, 40, 80, 80, 11360, 55040, 253440, 1056000, 3801600, 10982400, 21964800, 21964800, 857213660160, 7907423180800, 72155129446400, 645950912921600, 5622693241651200, 47110389109555200, 375570435981312000, 2811021970538496000, 19445103757787136000]

cp's OEIS Frontend

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

Table of values

List of values