login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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]. 2

%I

%S 4,10,40,215,1260,8010,53240,366680,2590420,18674660,136809240,

%T 1015603015,7622900360,57753364510,441081947840,3392237023425,

%U 26248421645200,204202630151860,1596256637347240,12531697773337965,98763817012822460,781102051887068160

%N Number of rooted binary MUL-trees with n leaves on the label set [4].

%H Andrew Howroyd, <a href="/A220817/b220817.txt">Table of n, a(n) for n = 1..200</a>

%H V. P. Johnson, <a href="http://people.math.sc.edu/czabarka/Theses/JohnsonThesis.pdf">Enumeration Results on Leaf Labeled Trees</a>, Ph. D. Dissertation, Univ. Southern Calif., 2012.

%t 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}]];

%t Array[a, 25] (* _Jean-Fran├žois Alcover_, Sep 02 2019, after _Alois P. Heinz_ in A319539 *)

%Y Column k=4 of A319539.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Dec 22 2012

%E Terms a(11) and beyond from _Andrew Howroyd_, Sep 23 2018

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 August 14 08:08 EDT 2020. Contains 336480 sequences. (Running on oeis4.)