LINKS
Vaclav Kotesovec, <a href="/A048816/b048816_1.txt">Table of n, a(n) for n = 1..3500</a> (terms 1..300 from Alois P. Heinz)
The OEIS is supported by the many generous donors to the OEIS Foundation.
Vaclav Kotesovec, <a href="/A048816/b048816_1.txt">Table of n, a(n) for n = 1..3500</a> (terms 1..300 from Alois P. Heinz)
editing
approved
Alois P. Heinz, Vaclav Kotesovec, <a href="/A048816/b048816_1.txt">Table of n, a(n) for n = 1..3500</a> (terms 1..300</a> from Alois P. Heinz)
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
A rooted tree is balanced if all leaves are the same distance from the root. The a(1) = 1 through a(7) = 12 balanced rooted trees with n nodes:
These are called balanced rooted trees. - Gus Wiseman, Oct 07 2018
A rooted tree is balanced if all leaves are the same distance from the root. The a(1) = 1 through a(7) = 12 balanced rooted trees with n nodes:
From Gus Wiseman, Oct 08 2018: (Start)
The a(1) = 1 through a(7) = 12 balanced rooted trees with n nodes:
o (o) (oo) (ooo) (oooo) (ooooo) (oooooo)
((o)) ((oo)) ((ooo)) ((oooo)) ((ooooo))
(((o))) (((oo))) (((ooo))) (((oooo)))
((o)(o)) ((o)(oo)) ((o)(ooo))
((((o)))) ((((oo)))) ((oo)(oo))
(((o)(o))) ((((ooo))))
(((((o))))) (((o)(oo)))
((o)(o)(o))
(((((oo)))))
((((o)(o))))
(((o))((o)))
((((((o))))))
(End)