OFFSET
1,3
COMMENTS
Consider the unlabeled binary, rooted, leaf-labeled tree topologies with n leaves (A001190). For each unlabeled topology, choose an arbitrary labeling with distinct labels for the n leaves, and assign it to both gene tree and species tree. Compute the number of coalescent histories for that matching (gene tree, species tree) pair according to a recursion (Rosenberg 2007, Theorem 3.1). The sequence a(n) gives the largest number observed among all unlabeled topologies.
LINKS
N. A. Rosenberg, Counting coalescent histories, J. Comput. Biol. 14 (2007), 360-377.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Noah A Rosenberg, Feb 14 2019
STATUS
approved