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.

A328349 Number of binary search trees (BST) on n nodes which have the same height as the optimal BST.

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 6
5 6
6 4
7 1
8 94
9 114
10 116
11 94
12 60
13 28
14 8
15 1
16 32398
17 41658
18 49700
19 54746
20 55308
21 50788
22 41944
23 30782
24 19788
25 10948
26 5096
27 1932
28 568
29 120
30 16
31 1
32 5193067630
33 6939692682
34 8948546308
35 11120136162
36 13299362332
37 15286065700
38 16859410792
39 17813777994
40 17999433372

List of values

[1, 1, 2, 1, 6, 6, 4, 1, 94, 114, 116, 94, 60, 28, 8, 1, 32398, 41658, 49700, 54746, 55308, 50788, 41944, 30782, 19788, 10948, 5096, 1932, 568, 120, 16, 1, 5193067630, 6939692682, 8948546308, 11120136162, 13299362332, 15286065700, 16859410792, 17813777994, 17999433372]

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

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