login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032068 Number of series-reduced dyslexic planted planar trees with n leaves of 2 colors where any 2 subtrees extending from the same node are different. 1
2, 1, 2, 7, 22, 85, 344, 1408, 5914, 25394, 110818, 488688, 2178594, 9797950, 44406134, 202591861, 929716110, 4288808485, 19876422076, 92501558277, 432109230664, 2025444499805, 9523528005822, 44906724639089 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Andrew Howroyd, Table of n, a(n) for n = 1..200

C. G. Bower, Transforms (2)

Index entries for sequences related to rooted trees

FORMULA

Doubles (index 2+) 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=[2]); for(i=2, n, v=concat(v, BGK(concat(v, [0]))[i])); v} \\ Andrew Howroyd, Sep 20 2018

CROSSREFS

Sequence in context: A056887 A144803 A095062 * A103410 A114303 A030651

Adjacent sequences:  A032065 A032066 A032067 * A032069 A032070 A032071

KEYWORD

nonn

AUTHOR

Christian G. Bower

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 11:52 EDT 2018. Contains 316379 sequences. (Running on oeis4.)