%I #10 Sep 20 2018 16:30:06
%S 1,1,1,2,3,6,13,29,65,151,365,887,2185,5426,13636,34529,88017,225621,
%T 581461,1505490,3913987,10214576,26748565,70263410,185089117,
%U 488842459,1294194744,3433966729,9130325683,24322504467
%N Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from the same node are different.
%H Andrew Howroyd, <a href="/A032066/b032066.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 "CGK" (necklace, elements, unlabeled) transform of A032065 (shifted right one place).
%o (PARI)
%o BGK(v)={apply(p->subst(serlaplace(y^0*p + polcoeff(p,1)),y,1)/2, Vec(prod(k=1, #v, (1 + x^k*y + O(x*x^#v))^v[k])-1, -#v))}
%o CGK(v)={apply(p->subst(serlaplace(p/y),y,1), Vec(prod(k=1, #v, (1 + x^k*y + O(x*x^#v))^v[k])-1, -#v))}
%o seq(n)={my(v=[1]); for(i=3, n, v=concat([1], BGK(v))); concat([1], CGK(v))} \\ _Andrew Howroyd_, Sep 20 2018
%K nonn
%O 1,4
%A _Christian G. Bower_