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!)
A220830 Number of unrooted binary leaf-multi-labeled trees with n leaves on the label set [3], with each label used at least once. 2
0, 0, 1, 6, 30, 140, 663, 3186, 15642, 78441, 400842, 2084698, 11009358, 58955139, 319619706, 1752122667, 9700923252, 54194387085, 305216395077, 1731579241287, 9889280682948, 56822058078669, 328300135291659, 1906449141877331, 11122447670117451, 65168427936552522 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
V. P. Johnson, Enumeration Results on Leaf Labeled Trees, Ph. D. Dissertation, Univ. Southern Calif., 2012.
FORMULA
a(n) = A220827(n) - 3*A220826(n) + 3*A129860(n). - Andrew Howroyd, Dec 14 2020
CROSSREFS
Column 3 of A339650.
Sequence in context: A082149 A002457 A137400 * A199938 A285195 A307321
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 22 2012
EXTENSIONS
Terms a(11) and beyond from Andrew Howroyd, Dec 14 2020
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 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)