login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032274 Number of labeled series-reduced dyslexic mobiles (polygon rooted trees) with n leaves (root has degree 0 or >=2). 1
1, 1, 4, 28, 277, 3532, 55093, 1016011, 21624349, 521677954, 14067076336, 419272679677, 13687252717378, 485693076265273, 18614089207916707, 766238746685395879, 33717600627620246296, 1579453179468556700596, 78472105193521600210579, 4121555441689179298651888 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Andrew Howroyd, Table of n, a(n) for n = 1..200

Index entries for sequences related to mobiles

FORMULA

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

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

PROG

(PARI) Vec(serlaplace(serreverse((3*x - x^2/2 + log(1-x + O(x^20)))/2))) \\ Andrew Howroyd, Sep 19 2018

CROSSREFS

Sequence in context: A303260 A174494 A128318 * A182964 A178599 A007559

Adjacent sequences:  A032271 A032272 A032273 * A032275 A032276 A032277

KEYWORD

nonn,eigen

AUTHOR

Christian G. Bower

EXTENSIONS

Terms a(19) and beyond from Andrew Howroyd, Sep 19 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 20:50 EDT 2018. Contains 316530 sequences. (Running on oeis4.)