The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306391 Number of polyphyletic coalescence sequences for 2n lineages, n each in 2 species. 0
0, 12, 2484, 1557792, 2560572000, 9326330280000, 66250877823900000, 834917902101803520000, 17373747843395915811840000, 564479089176417832085760000000, 27382950623629177584815808000000000 (list; graph; refs; listen; history; text; internal format)



Consider a binary tree evolving in time from a single node until the tree has 2n labeled leaves. Color the 2n leaves in 2 colors, red and blue, assigning n leaves to each color. Suppose coalescences of pairs of leaves happen at distinct times (i.e., no simultaneous mergers). A coalescence sequence is a sequence of coalescence events backward in time, tracing the reduction of the 2n leaves to the single ancestral node. Consider two possible features of the resulting tree: (1) all n red leaves have a common ancestor node that is not the ancestor of any blue leaves; (2) all n blue leaves have a common ancestor node that is not the ancestor of any red leaves. A reciprocally monophyletic sequence satisfies both (1) and (2). A paraphyletic coalescence sequence satisfies (1) or (2) but not both. A polyphyletic coalescence sequence does not satisfy either (1) or (2).


Table of n, a(n) for n=1..11.

N. A. Rosenberg, The shapes of neutral gene genealogies in two species: probabilities of monophyly, paraphyly, and polyphyly in a coalescent model, Evolution 57 (2003), 1465-1477.


a(n) = (1 - (2 n! n!/(2n)!)(7n-5)/((n+1)(2n-1))) (2n)! (2n-1)!/2^(2n-1).


For n=2, consider two red leaves R1 and R2 and two blue leaves B1 and B2. The a(2)=12 polyphyletic coalescence sequences, separated by semicolons, are (B1,R1), ((B1,R1),B2), (((B1,R1),B2),R2); (B1,R1), ((B1,R1),R2), (((B1,R1),R2),B2); (B1,R2), ((B1,R2),B2), (((B1,R2),B2),R1); (B1,R2), ((B1,R2),R1), (((B1,R2),R1),B2); (B2,R1), ((B2,R1),B1), (((B2,R1),B1),R2); (B2,R1), ((B2,R1),R2), (((B2,R1),R2),B1); (B2,R2), ((B2,R2),B1), (((B2,R2),B1),R1); (B2,R2), ((B2,R2),R1), (((B2,R2),R1),B1); (B1,R1), (B2,R2), ((B1,R1),(B2,R2)); (B1,R2), (B2,R1), ((B1,R2),(B2,R1)); (B2,R1), (B1,R2), ((B2,R1),(B1,R2)); (B2,R2), (B1,R1), ((B2,R2),(B1,R1)).


Table[(1 - (2 n! n!/(2 n)!) (7 n - 5)/((n + 1) (2 n - 1))) (2 n)! (2 n - 1)!/2^(2 n - 1), {n, 1, 30}]


(PARI) a(n) = (1 - (2*n!*n!/(2*n)!)*(7*n-5)/((n+1)*(2*n-1)))*(2*n)!*(2*n-1)!/2^(2*n-1); \\ Michel Marcus, Feb 12 2019


The total number of coalescence sequences for n leaves, from among which the polyphyletic coalescence sequences are identified, follows A006472. The sum of a(n), A306266(n), and A306350(n) is A006472(2n).

Sequence in context: A203426 A268589 A228289 * A195536 A010053 A092299

Adjacent sequences:  A306388 A306389 A306390 * A306392 A306393 A306394




Noah A Rosenberg, Feb 12 2019



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 26 11:05 EST 2020. Contains 331279 sequences. (Running on oeis4.)