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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A032105 Number of series-reduced dyslexic identity planted planar trees with n leaves of 2 colors. 1

%I #10 Aug 30 2018 15:04:56

%S 2,1,4,19,92,468,2470,13394,74296,419463,2403502,13941202,81707264,

%T 483131437,2878697568,17267416917,104186446502,631913206482,

%U 3850548301808,23561351983192,144715120126370

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

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

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

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

%F Doubles (index 2+) under "BHK" (reversible, identity, unlabeled) transform.

%o (PARI)

%o BHK(p)={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(BHK(p) + O(x*x^i), i)); Vecrev(p/x)} \\ _Andrew Howroyd_, Aug 30 2018

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

Last modified November 28 19:28 EST 2023. Contains 367419 sequences. (Running on oeis4.)