|
%I #10 Sep 20 2018 15:17:05
%S 1,1,1,2,3,6,14,31,69,159,396,944,2350,5811,14619,36968,94135,240167,
%T 619442,1597898,4148847,10803432,28240541,73948872,194487691,
%U 512132722,1352830588,3579378655,9495900793,25216707748
%N Number of dyslexic planted planar trees with n+1 nodes where any 2 subtrees extending from the same node are different sizes.
%H Andrew Howroyd, <a href="/A032047/b032047.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>
%F Shifts left under "BFK" (reversible, size, unlabeled) transform.
%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 seq(n)={my(v=[1]); for(i=2, n, v=concat([1], BFK(v))); v} \\ _Andrew Howroyd_, Sep 20 2018
%K nonn
%O 1,4
%A _Christian G. Bower_
|
