login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A220817 Number of rooted binary MUL-trees with n leaves on the label set [4]. 3
4, 10, 40, 215, 1260, 8010, 53240, 366680, 2590420, 18674660, 136809240, 1015603015, 7622900360, 57753364510, 441081947840, 3392237023425, 26248421645200, 204202630151860, 1596256637347240, 12531697773337965, 98763817012822460, 781102051887068160 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
V. P. Johnson, Enumeration Results on Leaf Labeled Trees, Ph. D. Dissertation, Univ. Southern Calif., 2012.
MATHEMATICA
a[n_] := a[n] = If[n < 2, 4 n, If[OddQ[n], 0, (# (1 - #)/2 &)[a[n/2]]] + Sum[a[i] a[n - i], {i, 1, n/2}]];
Array[a, 25] (* Jean-François Alcover, Sep 02 2019, after Alois P. Heinz in A319539 *)
CROSSREFS
Column k=4 of A319539.
Sequence in context: A356968 A370997 A355993 * A346889 A114918 A224488
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)