A348851 - cp's OEIS frontend

A348851 a(n) is the number of labeled rooted ordered 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.

n	a(n)
1	1
2	1
3	2
4	2
5	4
6	8
7	12
8	20
9	36
10	72
11	92
12	172
13	264
14	456
15	864
16	1168
17	1920
18	2896
19	4960
20	7224
21	13968
22	17904
23	29184
24	43584
25	71024
26	100000
27	165248
28	257856
29	365248
30	532864
31	800464
32	1216960
33	1794288
34	2757888
35	3948672
36	6237280
37	8489760
38	12342432
39	17454816
40	26658048
41	36949728
42	56283168

[1, 1, 2, 2, 4, 8, 12, 20, 36, 72, 92, 172, 264, 456, 864, 1168, 1920, 2896, 4960, 7224, 13968, 17904, 29184, 43584, 71024, 100000, 165248, 257856, 365248, 532864, 800464, 1216960, 1794288, 2757888, 3948672, 6237280, 8489760, 12342432, 17454816, 26658048, 36949728, 56283168]

cp's OEIS Frontend

A348851 a(n) is the number of labeled rooted ordered 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

List of values