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.

A363272 Irregular triangle read by rows: T(n,k) = number of unlabeled binary rooted trees with n leaves, where some child tree has k leaves, 1 <= k <= n/2.

Table of values

n a(n)
2 1
3 1
4 1
5 1
6 2
7 1
8 3
9 2
10 1
11 6
12 3
13 2
14 11
15 6
16 3
17 3
18 23
19 11
20 6
21 6
22 46
23 23
24 11
25 12
26 6
27 98
28 46
29 23
30 22
31 18
32 207
33 98
34 46
35 46
36 33
37 21
38 451
39 207
40 98
41 92
42 69
43 66
44 983
45 451
46 207
47 196
48 138
49 138
50 66
51 2179
52 983
53 451
54 414
55 294
56 276
57 253
58 4850
59 2179
60 983
61 902
62 621
63 588
64 506
65 276

List of values

[1, 1, 1, 1, 2, 1, 3, 2, 1, 6, 3, 2, 11, 6, 3, 3, 23, 11, 6, 6, 46, 23, 11, 12, 6, 98, 46, 23, 22, 18, 207, 98, 46, 46, 33, 21, 451, 207, 98, 92, 69, 66, 983, 451, 207, 196, 138, 138, 66, 2179, 983, 451, 414, 294, 276, 253, 4850, 2179, 983, 902, 621, 588, 506, 276]