This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A306422 #12 Mar 10 2019 12:40:32 %S A306422 1,1,2,5,14,42,138,462,1663 %N A306422 Maximal number of coalescent histories among matching pairs of binary, rooted leaf-labeled gene trees and species trees with n leaves. %C A306422 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. %H A306422 N. A. Rosenberg, <a href="https://doi.org/10.1089/cmb.2006.0109">Counting coalescent histories</a>, J. Comput. Biol. 14 (2007), 360-377. %Y A306422 Cf. A001190. %Y A306422 A000108 and A005817 give the numbers of coalescent histories for specific families of matching gene trees and species trees. %K A306422 nonn,more %O A306422 1,3 %A A306422 _Noah A Rosenberg_, Feb 14 2019