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 A063573 #18 Apr 22 2022 18:11:39
%S A063573 1,2,10,170,33490,1133870930,1285739648704587610,
%T A063573 1653126447166808568966775665261637370
%N A063573 First differences of A002065.
%C A063573 Number of trees of height n generated by unary and binary composition. - Claude Lenormand (claude.lenormand(AT)free.fr), Sep 05 2001
%H A063573 Michael De Vlieger, <a href="/A063573/b063573.txt">Table of n, a(n) for n = 0..11</a>
%H A063573 Samuele Giraudo, <a href="https://arxiv.org/abs/2204.03586">The combinator M and the Mockingbird lattice</a>, arXiv:2204.03586 [math.CO], 2022.
%H A063573 Samuele Giraudo, <a href="https://igm.univ-mlv.fr/~giraudo/Data/Papers/Mockingbird%20lattices.pdf">Mockingbird lattices</a>, Séminaire Lotharingien de Combinatoire XX, Proceedings of the 34th Conf. on Formal Power, Series and Algebraic Combinatorics (Bangalore, India, 2022).
%H A063573 <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>
%F A063573 a(n) = a(n-1)^2 + 2 a(n-1) sqrt(a(n-1)-1) + a(n-1) for n > 0. [_Charles R Greathouse IV_, Dec 29 2011]
%t A063573 a[0] = 1; Do[a[n] = a[n - 1]^2 + 2 a[n - 1] Sqrt[a[n - 1] - 1] + a[n - 1], {n, 7}]; Array[a, 8, 0] (* _Michael De Vlieger_, Apr 13 2022 *)
%o A063573 (PARI) a(n)=if(n,my(k=a(n-1));k^2+2*k*sqrtint(k-1)+k,1) \\ _Charles R Greathouse IV_, Dec 29 2011
%Y A063573 Cf. A002065.
%K A063573 nonn
%O A063573 0,2
%A A063573 _N. J. A. Sloane_, Sep 06 2001