Unrooted binary tree enumeration problem on unrooted binary trees is to count the number of trees with "n" labeled leaves and unlabeled internal nodes. An unrooted binary tree on "n" labeled leaves can be formed by connecting the "n"th leaf to a new node in the middle of any of the edges of an unrooted binary tree on "n" − 1 labeled leaves. There are 2"n" − 5 edges at which the "n"th node can be attached; therefore, the number of trees on "n" leaves is larger than the number of trees on "n" − 1 leaves by a factor of 2"n" −
Combinatorial number system of a set "S" is a subset of "S" with "k" (distinct) elements. The main purpose of the combinatorial number system is to provide a representation, each by a single number, of all formula_1 possible "k"-combinations of a set "S" of "n" elements. Choosing, for any "n", } as such a set, it can be arranged that the representation of a given "k"-combination "C" is independent of the value of "n" (although "n" must of course be sufficiently large); in other words considering "C" as a subset of a larger set by increasing "n" will not change the number that