This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A032101 #11 Aug 30 2018 15:00:01
%S A032101 1,1,1,2,4,11,28,78,212,598,1686,4841,13975,40777,119698,353905,
%T A032101 1051948,3143582,9436033,28443340,86055366,261253380,795587214,
%U A032101 2429692385,7439569568,22834518491,70243063795,216527666056
%N A032101 Number of dyslexic identity planted planar trees with n+1 nodes.
%H A032101 Andrew Howroyd, <a href="/A032101/b032101.txt">Table of n, a(n) for n = 1..200</a>
%H A032101 C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%H A032101 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A032101 Shifts left under "BHK" (reversible, identity, unlabeled) transform
%o A032101 (PARI)
%o A032101 BHK(p)={p + (1/(1-p) - (1+p)/subst(1-p, x, x^2))/2}
%o A032101 seq(n)={my(p=O(1));for(i=1, n, p=1+BHK(x*p)); Vec(p)} \\ _Andrew Howroyd_, Aug 30 2018
%K A032101 nonn,eigen
%O A032101 1,4
%A A032101 _Christian G. Bower_