A110316 - cp's OEIS frontend

A110316 a(n) is the number of different shapes of balanced binary trees with n nodes. The tree is balanced if the total number of nodes in the left and right branch of every node differ by at most one.

n	a(n)
0	1
1	1
2	2
3	1
4	4
5	4
6	4
7	1
8	8
9	16
10	32
11	16
12	32
13	16
14	8
15	1
16	16
17	64
18	256
19	256
20	1024
21	1024
22	1024
23	256
24	1024
25	1024
26	1024
27	256
28	256
29	64
30	16
31	1
32	32
33	256
34	2048
35	4096
36	32768
37	65536
38	131072
39	65536
40	524288
41	1048576
42	2097152
43	1048576
44	2097152
45	1048576
46	524288
47	65536
48	524288

[1, 1, 2, 1, 4, 4, 4, 1, 8, 16, 32, 16, 32, 16, 8, 1, 16, 64, 256, 256, 1024, 1024, 1024, 256, 1024, 1024, 1024, 256, 256, 64, 16, 1, 32, 256, 2048, 4096, 32768, 65536, 131072, 65536, 524288, 1048576, 2097152, 1048576, 2097152, 1048576, 524288, 65536, 524288]

cp's OEIS Frontend

A110316 a(n) is the number of different shapes of balanced binary trees with n nodes. The tree is balanced if the total number of nodes in the left and right branch of every node differ by at most one.

Table of values

List of values