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" −
Kepler object of interest planet that is substantially larger than what is estimated by "Kepler". This occurs when there are sources of light other than simply the star being transited, such as in a binary system. In cases such as these, there is more surface area producing light than is assumed, so a given transit signal is larger than assumed. Since roughly 34% of stellar systems are binaries, up to 34% of KOI signals could be from planets within binary systems and, consequently, be larger than estimated (assuming planets are as likely to form in binary systems as they are in single star systems).