The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A032103 Number of dyslexic identity planted planar trees with n+1 nodes and leaves of 2 colors. 1
 2, 2, 3, 9, 32, 125, 489, 1971, 8057, 33582, 141854, 606967, 2623678, 11444588, 50306835, 222638649, 991173730, 4435974275, 19946529375, 90069370028, 408261634445, 1856940442884, 8472695323318 (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) FORMULA Shifts left 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=O(1)); for(i=1, n, p=2+BHK(x*p)); Vec(p)} \\ Andrew Howroyd, Aug 30 2018 CROSSREFS Sequence in context: A021821 A019234 A032172 * A091044 A079661 A220644 Adjacent sequences:  A032100 A032101 A032102 * A032104 A032105 A032106 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 20 05:31 EDT 2021. Contains 343121 sequences. (Running on oeis4.)