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!)
 A032101 Number of dyslexic identity planted planar trees with n+1 nodes. 2
 1, 1, 1, 2, 4, 11, 28, 78, 212, 598, 1686, 4841, 13975, 40777, 119698, 353905, 1051948, 3143582, 9436033, 28443340, 86055366, 261253380, 795587214, 2429692385, 7439569568, 22834518491, 70243063795, 216527666056 (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 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=1+BHK(x*p)); Vec(p)} \\ Andrew Howroyd, Aug 30 2018 CROSSREFS Sequence in context: A108629 A007048 A148132 * A005200 A148133 A148134 Adjacent sequences:  A032098 A032099 A032100 * A032102 A032103 A032104 KEYWORD nonn,eigen 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 06:59 EDT 2021. Contains 343125 sequences. (Running on oeis4.)