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.

A299037 a(n) is the number of rooted binary trees with minimal Sackin index and n leaves.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 2
7 1
8 1
9 1
10 3
11 3
12 5
13 3
14 3
15 1
16 1
17 1
18 4
19 6
20 14
21 17
22 27
23 28
24 35
25 28
26 27
27 17
28 14
29 6
30 4
31 1
32 1
33 1
34 5
35 10
36 30
37 55
38 121
39 207
40 378
41 575
42 894
43 1217
44 1651
45 1993
46 2373
47 2546
48 2682
49 2546
50 2373
51 1993
52 1651
53 1217
54 894
55 575
56 378
57 207
58 121
59 55
60 30
61 10
62 5
63 1
64 1
65 1
66 6
67 15
68 55
69 135
70 381
71 903
72 2205
73 4848
74 10599
75 21631

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 5, 3, 3, 1, 1, 1, 4, 6, 14, 17, 27, 28, 35, 28, 27, 17, 14, 6, 4, 1, 1, 1, 5, 10, 30, 55, 121, 207, 378, 575, 894, 1217, 1651, 1993, 2373, 2546, 2682, 2546, 2373, 1993, 1651, 1217, 894, 575, 378, 207, 121, 55, 30, 10, 5, 1, 1, 1, 6, 15, 55, 135, 381, 903, 2205, 4848, 10599, 21631]