A084107 A014486-encoding of "Complete Binary Trees".

0, 2, 50, 14642, 1016674610, 4489135110542145842, 83940259113354708787282267381662562610, 28755706180189132304920279902696353117047700481289459579932708798287463397682

Offset

0,2

Comments

"Complete" or "full binary tree" refers to a unique binary tree of (2^n)-1 nodes with its 2^(n-1) leaves all on the same height (or depth) n-1 (when the root is at height 0). These are depicted at A073346. This differs from "completely binary tree", with which some authors refer to trees more akin to the trees encoded by A080299.

Links

Table of n, a(n) for n=0..7.

Index entries for encodings of plane rooted trees

Crossrefs

a(n) = A014486(A084108(n)). Subset of A083941.

Sequence in context: A203766 A197487 A080293 * A203746 A230561 A057943

Adjacent sequences: A084104 A084105 A084106 * A084108 A084109 A084110

Keyword

nonn

Author

Antti Karttunen, May 13 2003

Status

approved