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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A220820 Number of rooted binary leaf-multilabeled trees with n leaves on the label set [3]. 2
 0, 0, 3, 27, 180, 1089, 6333, 36309, 207255, 1184829, 6799473, 39224568, 227554278, 1327688328, 7789644996, 45944320449, 272329169232, 1621636729257, 9697502473014, 58219671592098, 350791368690516, 2120672113779573, 12859687160772771, 78201772222916649 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..200 V. P. Johnson, Enumeration Results on Leaf Labeled Trees, Ph. D. Dissertation, Univ. Southern Calif., 2012. MAPLE b:= proc(n, k) option remember; `if`(n<2, k*n, `if`(n::odd, 0,       (t-> t*(1-t)/2)(b(n/2, k)))+add(b(i, k)*b(n-i, k), i=1..n/2))     end: a:= n-> (k-> add((-1)^i*binomial(k, i)*b(n, k-i), i=0..k))(3): seq(a(n), n=1..30);  # Alois P. Heinz, Sep 07 2019 MATHEMATICA b[n_, k_] := b[n, k] = If[n < 2, k n, If[OddQ[n], 0, Function[t, t(1 - t)/2 ][b[n/2, k]]] + Sum[b[i, k] b[n - i, k], {i, 1, n/2}]]; a[n_] := Function[k, Sum[(-1)^i Binomial[k, i] b[n, k - i], {i, 0, k}]][3]; Array[a, 30] (* Jean-François Alcover, Apr 08 2020, after Alois P. Heinz *) CROSSREFS Column k=3 of A319541. Sequence in context: A053932 A027507 A297670 * A241271 A222015 A127215 Adjacent sequences:  A220817 A220818 A220819 * A220821 A220822 A220823 KEYWORD nonn AUTHOR N. J. A. Sloane, Dec 22 2012 EXTENSIONS Terms a(11) and beyond from Andrew Howroyd, Sep 23 2018 STATUS approved

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.

Last modified October 23 20:47 EDT 2020. Contains 337975 sequences. (Running on oeis4.)