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!)
A055358 Number of increasing mobiles (circular rooted trees) with n nodes and 4 leaves. 2

%I #12 Mar 15 2022 04:30:28

%S 6,96,874,6040,35458,187288,920350,4297240,19332662,84615152,

%T 362772194,1531122296,6385177274,26382771464,108232980822,

%U 441554515704,1793612585550,7261158583200,29318205685050

%N Number of increasing mobiles (circular rooted trees) with n nodes and 4 leaves.

%H Georg Fischer, <a href="/A055358/b055358.txt">Table of n, a(n) for n = 5..250</a>

%H <a href="/index/Mo#mobiles">Index entries for sequences related to mobiles</a>

%F 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

%Y Column 4 of A055356.

%K nonn

%O 5,1

%A _Christian G. Bower_, May 15 2000

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 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)