|
%I #10 Sep 20 2018 16:25:42
%S 1,1,1,2,3,6,13,29,64,148,355,857,2100,5198,12960,32701,82826,211352,
%T 541832,1397654,3614607,9402256,24500619,64134061,168178732,442710004,
%U 1166705391,3085691999,8168951368,21689446136
%N Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from a node are of different sizes.
%H Andrew Howroyd, <a href="/A032048/b032048.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 "CFK" (necklace, size, unlabeled) transform of A032047 (shifted right one place).
%o (PARI)
%o BFK(v)={apply(p->subst(serlaplace(y^0*p + polcoeff(p,1)),y,1)/2, Vec(-1+prod(k=1, #v, 1 + v[k]*x^k*y + O(x*x^#v)), -#v))}
%o CFK(v)={apply(p->subst(serlaplace(p/y),y,1), Vec(-1+prod(k=1, #v, 1 + v[k]*x^k*y + O(x*x^#v)), -#v))}
%o seq(n)={my(v=[1]); for(i=3, n, v=concat([1], BFK(v))); concat([1], CFK(v))} \\ _Andrew Howroyd_, Sep 20 2018
%Y Cf. A032047.
%K nonn
%O 1,4
%A _Christian G. Bower_
|
