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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A032105 Number of series-reduced dyslexic identity planted planar trees with n leaves of 2 colors. 1
 2, 1, 4, 19, 92, 468, 2470, 13394, 74296, 419463, 2403502, 13941202, 81707264, 483131437, 2878697568, 17267416917, 104186446502, 631913206482, 3850548301808, 23561351983192, 144715120126370 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..200 Index entries for sequences related to rooted trees C. G. Bower, Transforms (2) FORMULA Doubles (index 2+) under "BHK" (reversible, identity, unlabeled) transform. PROG (PARI) BHK(p)={p + (1/(1-p) - (1+p)/subst(1-p, x, x^2))/2} seq(n)={my(p=2*x); for(i=2, n, p+=x^i*polcoeff(BHK(p) + O(x*x^i), i)); Vecrev(p/x)} \\ Andrew Howroyd, Aug 30 2018 CROSSREFS Sequence in context: A012930 A013162 A010252 * A259472 A354055 A053565 Adjacent sequences: A032102 A032103 A032104 * A032106 A032107 A032108 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 25 13:10 EDT 2023. Contains 365647 sequences. (Running on oeis4.)