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!)
 A220822 Number of rooted binary leaf-multilabeled trees with n leaves on the label set [5]. 2
 0, 0, 0, 0, 105, 2625, 42075, 554820, 6578550, 73169250, 781319370, 8122058850, 82922497890, 836339477160, 8366154130425, 83235403604220, 825247074255735, 8165187992777430, 80704316324506860, 797435573602269015, 7881226621071221625, 77939438593071188565 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 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))(5): 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}]][5]; Array[a, 30] (* Jean-François Alcover, Apr 08 2020, after Alois P. Heinz *) CROSSREFS Column 5 of A319541. Sequence in context: A024198 A027788 A112497 * A166821 A166803 A262075 Adjacent sequences:  A220819 A220820 A220821 * A220823 A220824 A220825 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 September 27 09:09 EDT 2020. Contains 337380 sequences. (Running on oeis4.)