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

 


Number of labeled series-reduced dyslexic mobiles (polygon rooted trees) with n leaves (root has degree 0 or >=2).
1

%I #10 Sep 20 2018 00:33:15

%S 1,1,4,28,277,3532,55093,1016011,21624349,521677954,14067076336,

%T 419272679677,13687252717378,485693076265273,18614089207916707,

%U 766238746685395879,33717600627620246296,1579453179468556700596,78472105193521600210579,4121555441689179298651888

%N Number of labeled series-reduced dyslexic mobiles (polygon rooted trees) with n leaves (root has degree 0 or >=2).

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

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

%F Doubles (index 2+) under "DIJ" (bracelet, indistinct, labeled) transform.

%F E.g.f.: series reversion of (3*x - x^2/2 + log(1-x))/2. - _Andrew Howroyd_, Sep 19 2018

%o (PARI) Vec(serlaplace(serreverse((3*x - x^2/2 + log(1-x + O(x^20)))/2))) \\ _Andrew Howroyd_, Sep 19 2018

%K nonn,eigen

%O 1,3

%A _Christian G. Bower_

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 23 08:25 EDT 2024. Contains 376146 sequences. (Running on oeis4.)