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!)
A032133 Number of series-reduced dyslexic planted planar trees with n leaves of 2 colors. 1

%I #11 Aug 30 2018 15:50:14

%S 2,3,12,61,340,2070,13178,87115,590720,4089214,28766442,205072330,

%T 1478149486,10754615963,78878136418,582563752101,4328922702536,

%U 32341244773080,242781826475456,1830377795460438

%N Number of series-reduced dyslexic planted planar trees with n leaves of 2 colors.

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

%H C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>

%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>

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

%o (PARI)

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

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

%Y Cf. A032132.

%K nonn

%O 1,1

%A _Christian G. Bower_

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 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)