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.

A265846 Number of permutations of {1,2,...,2n} that result in a binary search tree of height n.

Table of values

n a(n)
0 1
1 0
2 0
3 80
4 11360
5 1508032
6 197163648
7 27624399104
8 4256968553472
9 724948555548672
10 136034167652859904
11 27976811931437752320
12 6269253131872946298880
13 1522110257603797873737728
14 398311795891656532955725824
15 111813044381693547723191418880

List of values

[1, 0, 0, 80, 11360, 1508032, 197163648, 27624399104, 4256968553472, 724948555548672, 136034167652859904, 27976811931437752320, 6269253131872946298880, 1522110257603797873737728, 398311795891656532955725824, 111813044381693547723191418880]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.