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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055358 Number of increasing mobiles (circular rooted trees) with n nodes and 4 leaves. 2
 6, 96, 874, 6040, 35458, 187288, 920350, 4297240, 19332662, 84615152, 362772194, 1531122296, 6385177274, 26382771464, 108232980822, 441554515704, 1793612585550, 7261158583200, 29318205685050 (list; graph; refs; listen; history; text; internal format)
 OFFSET 5,1 LINKS Georg Fischer, Table of n, a(n) for n = 5..250 FORMULA For n>0, a(n) = 31*2^(2*n - 3)/9 - 5*(n+2)*3^n/12 + (n^2 + 2*n + 2)*2^(n-2) - n^3/6 - n/4 - 1/18. - Vaclav Kotesovec, Mar 15 2022 CROSSREFS Column 4 of A055356. Sequence in context: A053338 A115400 A279868 * A030989 A288845 A006044 Adjacent sequences: A055355 A055356 A055357 * A055359 A055360 A055361 KEYWORD nonn AUTHOR Christian G. Bower, May 15 2000 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.

Last modified December 6 14:43 EST 2022. Contains 358644 sequences. (Running on oeis4.)