The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A032048 Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from a node are of different sizes. 1
 1, 1, 1, 2, 3, 6, 13, 29, 64, 148, 355, 857, 2100, 5198, 12960, 32701, 82826, 211352, 541832, 1397654, 3614607, 9402256, 24500619, 64134061, 168178732, 442710004, 1166705391, 3085691999, 8168951368, 21689446136 (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 "CFK" (necklace, size, unlabeled) transform of A032047 (shifted right one place). 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))} CFK(v)={apply(p->subst(serlaplace(p/y), y, 1), Vec(-1+prod(k=1, #v, 1 + v[k]*x^k*y + O(x*x^#v)), -#v))} seq(n)={my(v=[1]); for(i=3, n, v=concat([1], BFK(v))); concat([1], CFK(v))} \\ Andrew Howroyd, Sep 20 2018 CROSSREFS Cf. A032047. Sequence in context: A000646 A316770 A197463 * A287128 A286062 A219226 Adjacent sequences: A032045 A032046 A032047 * A032049 A032050 A032051 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 27 12:24 EST 2023. Contains 359840 sequences. (Running on oeis4.)