[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A006682
Number of binary phylogenetic trees with n labels.
(Formerly M3571)
0
1, 4, 20, 155, 1716, 24654, 434155, 9043990, 217457456, 5926620029, 180538177590, 6078622845750, 224156328707221, 8984765008810504, 388939866084222200, 18083736252080051435, 898779656769444326136, 47551736771345760732954
OFFSET
2,2
REFERENCES
Foulds, L. R.; Robinson, R. W. Enumeration of binary phylogenetic trees. Combinatorial mathematics, VIII (Geelong, 1980), pp. 187-202, Lecture Notes in Math., 884, Springer, Berlin-New York, 1981. Math. Rev. 83a:05071.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
L. R. Foulds and R. W. Robinson, Enumeration of binary phylogenetic trees, pp. 187-202, Lecture Notes in Math., 884, Springer, Berlin-New York, 1981. (Annotated scanned copy)
FORMULA
a(n) = Sum_{k=2..n} S(n, k) * A006680(k) where S(n, k) are Stirling numbers of the second kind. - Sean A. Irvine, Jun 16 2017
CROSSREFS
Sequence in context: A094070 A335627 A119022 * A115852 A058381 A094651
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms and offset corrected by Sean A. Irvine, Jun 16 2017
STATUS
approved