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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032133 Number of series-reduced dyslexic planted planar trees with n leaves of 2 colors. 1
2, 3, 12, 61, 340, 2070, 13178, 87115, 590720, 4089214, 28766442, 205072330, 1478149486, 10754615963, 78878136418, 582563752101, 4328922702536, 32341244773080, 242781826475456, 1830377795460438 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

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

Doubles (index 2+) under "BIK" (reversible, indistinct, unlabeled) transform.

PROG

(PARI)

BIK(p)={(1/(1-p) + (1+p)/subst(1-p, x, x^2))/2}

seq(n)={my(p=2*x); for(i=2, n, p+=x^i*polcoeff(BIK(p) + O(x*x^i), i)); Vecrev(p/x)} \\ Andrew Howroyd, Aug 30 2018

CROSSREFS

Cf. A032132.

Sequence in context: A052183 A123899 A188588 * A155579 A108261 A013152

Adjacent sequences:  A032130 A032131 A032132 * A032134 A032135 A032136

KEYWORD

nonn

AUTHOR

Christian G. Bower

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 22 06:02 EDT 2018. Contains 316432 sequences. (Running on oeis4.)