login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A032065
Number of dyslexic planted planar trees with n+1 nodes where any 2 subtrees extending from the same node are different.
2
1, 1, 1, 2, 3, 6, 14, 31, 70, 163, 407, 984, 2445, 6089, 15412, 39189, 100217, 257720, 666068, 1729169, 4505362, 11784473, 30917383, 81358804, 214658044, 567792612, 1505281859, 3999183421, 10645793860
OFFSET
1,4
FORMULA
Shifts left under "BGK" (reversible, element, unlabeled) transform.
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))}
seq(n)={my(v=[1]); for(i=2, n, v=concat([1], BGK(v))); v} \\ Andrew Howroyd, Sep 20 2018
CROSSREFS
Sequence in context: A006444 A335242 A032047 * A307231 A099968 A291401
KEYWORD
nonn
STATUS
approved