cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A076616 Number of permutations of {1,2,...,n} that result in a binary search tree (when elements of the permutation are inserted in that order) of height n-1 (i.e., the second largest possible height).

Table of values

n a(n)
0 0
1 0
2 0
3 2
4 16
5 64
6 208
7 608
8 1664
9 4352
10 11008
11 27136
12 65536
13 155648
14 364544
15 843776
16 1933312
17 4390912
18 9895936
19 22151168
20 49283072
21 109051904
22 240123904
23 526385152
24 1149239296
25 2499805184
26 5419040768
27 11710496768
28 25232932864
29 54223962112
30 116232552448

List of values

[0, 0, 0, 2, 16, 64, 208, 608, 1664, 4352, 11008, 27136, 65536, 155648, 364544, 843776, 1933312, 4390912, 9895936, 22151168, 49283072, 109051904, 240123904, 526385152, 1149239296, 2499805184, 5419040768, 11710496768, 25232932864, 54223962112, 116232552448]