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!)
A032103 Number of dyslexic identity planted planar trees with n+1 nodes and leaves of 2 colors. 1

%I #11 Aug 30 2018 15:00:21

%S 2,2,3,9,32,125,489,1971,8057,33582,141854,606967,2623678,11444588,

%T 50306835,222638649,991173730,4435974275,19946529375,90069370028,

%U 408261634445,1856940442884,8472695323318

%N Number of dyslexic identity planted planar trees with n+1 nodes and leaves of 2 colors.

%H Andrew Howroyd, <a href="/A032103/b032103.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 Shifts left 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=O(1));for(i=1, n, p=2+BHK(x*p)); Vec(p)} \\ _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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 03:28 EDT 2024. Contains 371696 sequences. (Running on oeis4.)