Number of branches in all binary trees with n edges. A binary tree is a rooted tree in which each vertex has at most two children and each child of a vertex is designated as its left or right child.
A121686
Number of branches in all binary trees with n edges. A binary tree is a rooted tree in which each vertex has at most two children and each child of a vertex is designated as its left or right child.
Terms
- a(0) =2a(1) =6a(2) =22a(3) =84a(4) =324a(5) =1254a(6) =4862a(7) =18876a(8) =73372a(9) =285532a(10) =1112412a(11) =4338536a(12) =16938120a(13) =66192390a(14) =258909390a(15) =1013586540a(16) =3971224620a(17) =15571021620a(18) =61096813140a(19) =239888764440a(20) =942483155640
External references
- oeis: A121686