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.

A348850 a(n) is the number of labeled rooted unordered binary trees T where the nodes are labeled with distinct positive integers, the root has label n, each parent label equals the sum of its children labels, and T cannot be extended.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 2
7 3
8 5
9 9
10 10
11 14
12 22
13 33
14 57
15 66
16 94
17 132
18 188
19 317
20 454
21 576
22 806
23 1083
24 1535
25 2342
26 3215
27 5231
28 5656
29 8545
30 10804
31 15226
32 21153
33 30342
34 44536
35 63165
36 73877
37 107241
38 133994
39 178497
40 247564
41 331695
42 472331

List of values

[1, 1, 1, 1, 2, 2, 3, 5, 9, 10, 14, 22, 33, 57, 66, 94, 132, 188, 317, 454, 576, 806, 1083, 1535, 2342, 3215, 5231, 5656, 8545, 10804, 15226, 21153, 30342, 44536, 63165, 73877, 107241, 133994, 178497, 247564, 331695, 472331]