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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038035 Number of labeled dyslexic planted planar trees with n+1 nodes. 2
1, 2, 9, 72, 840, 12780, 238770, 5281920, 134946000, 3909578400, 126638542800, 4535037460800, 177904622095200, 7586967310322400, 349479111223242000, 17292052928037888000, 914673660594613920000, 51506610632458293312000, 3076341001739003430432000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

C. G. Bower, Transforms (2)

Index entries for sequences related to rooted trees

FORMULA

Divides by n and shifts left under "BIJ" (reversible, indistinct, labeled) transform.

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

PROG

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

CROSSREFS

Cf. A005470, A032128.

Sequence in context: A258114 A133941 A240956 * A133984 A208898 A108995

Adjacent sequences:  A038032 A038033 A038034 * A038036 A038037 A038038

KEYWORD

nonn,eigen

AUTHOR

Christian G. Bower, Sep 15 1998

EXTENSIONS

Terms a(16) 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:21 EDT 2019. Contains 322406 sequences. (Running on oeis4.)