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" −
Star system even more complex dynamics of the large number of stars in star clusters and galaxies. In a "physical" triple star system, each star orbits the center of mass of the system. Usually, two of the stars form a close binary system, and the third orbits this pair at a distance much larger than that of the binary orbit. This arrangement is called "hierarchical". The reason for this is that if the inner and outer orbits are comparable in size, the system may become dynamically unstable, leading to a star being ejected from the system. Triple stars that are "not" all