Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A032066
Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from the same node are different.
1
1, 1, 1, 2, 3, 6, 13, 29, 65, 151, 365, 887, 2185, 5426, 13636, 34529, 88017, 225621, 581461, 1505490, 3913987, 10214576, 26748565, 70263410, 185089117, 488842459, 1294194744, 3433966729, 9130325683, 24322504467
OFFSET
1,4
FORMULA
"CGK" (necklace, elements, unlabeled) transform of A032065 (shifted right one place).
PROG
(PARI)
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))}
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))}
seq(n)={my(v=[1]); for(i=3, n, v=concat([1], BGK(v))); concat([1], CGK(v))} \\ Andrew Howroyd, Sep 20 2018
CROSSREFS
Sequence in context: A286062 A219226 A238426 * A107316 A124682 A079512
KEYWORD
nonn
STATUS
approved