

A032047


Number of dyslexic planted planar trees with n+1 nodes where any 2 subtrees extending from the same node are different sizes.


2



1, 1, 1, 2, 3, 6, 14, 31, 69, 159, 396, 944, 2350, 5811, 14619, 36968, 94135, 240167, 619442, 1597898, 4148847, 10803432, 28240541, 73948872, 194487691, 512132722, 1352830588, 3579378655, 9495900793, 25216707748
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


LINKS

Andrew Howroyd, Table of n, a(n) for n = 1..200
Index entries for sequences related to rooted trees


FORMULA

Shifts left under "BFK" (reversible, size, unlabeled) transform.


PROG

(PARI)
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))}
seq(n)={my(v=[1]); for(i=2, n, v=concat([1], BFK(v))); v} \\ Andrew Howroyd, Sep 20 2018


CROSSREFS

Sequence in context: A211931 A264078 A006444 * A032065 A099968 A291401
Adjacent sequences: A032044 A032045 A032046 * A032048 A032049 A032050


KEYWORD

nonn


AUTHOR

Christian G. Bower


STATUS

approved



