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.

A345135 Number of ordered rooted binary trees with n leaves and with minimal Sackin tree balance index.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 1
5 4
6 6
7 4
8 1
9 8
10 28
11 56
12 70
13 56
14 28
15 8
16 1
17 16
18 120
19 560
20 1820
21 4368
22 8008
23 11440
24 12870
25 11440
26 8008
27 4368
28 1820
29 560
30 120
31 16
32 1
33 32
34 496
35 4960
36 35960
37 201376
38 906192
39 3365856
40 10518300
41 28048800
42 64512240
43 129024480
44 225792840
45 347373600
46 471435600

List of values

[1, 1, 1, 2, 1, 4, 6, 4, 1, 8, 28, 56, 70, 56, 28, 8, 1, 16, 120, 560, 1820, 4368, 8008, 11440, 12870, 11440, 8008, 4368, 1820, 560, 120, 16, 1, 32, 496, 4960, 35960, 201376, 906192, 3365856, 10518300, 28048800, 64512240, 129024480, 225792840, 347373600, 471435600]