This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..200 C. G. Bower, Transforms (2) 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 Adjacent sequences:  A032063 A032064 A032065 * A032067 A032068 A032069 KEYWORD nonn AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 23 21:41 EDT 2018. Contains 316541 sequences. (Running on oeis4.)