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 A108526 #9 Aug 31 2018 15:41:55
%S A108526 1,2,5,16,54,210,841,3555,15402,68336,308206,1410175,6525500,30492934,
%T A108526 143669529,681781043,3255653089,15632422715,75429279214,365556955492,
%U A108526 1778608580060,8684658137204,42543288504844,209022441144144
%N A108526 Number of mobiles (cycle rooted trees) with n generators.
%C A108526 A generator is a leaf or a node with just one child.
%H A108526 Andrew Howroyd, <a href="/A108526/b108526.txt">Table of n, a(n) for n = 1..200</a>
%H A108526 C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%H A108526 <a href="/index/Mo#mobiles">Index entries for sequences related to mobiles</a>
%F A108526 G.f. satisfies (2-x)*A(x) = x - 1 + CIK(A(x)).
%o A108526 (PARI)
%o A108526 CIK(p,n)={sum(d=1, n, eulerphi(d)/d*log(subst(1/(1+O(x*x^(n\d))-p), x, x^d)))}
%o A108526 seq(n)={my(p=x); for(n=2, n, p += x^n*polcoef(x*p + CIK(p, n), n)); Vecrev(p/x)} \\ _Andrew Howroyd_, Aug 31 2018
%Y A108526 Cf. A108521-A108529, A032200, A032203.
%K A108526 nonn
%O A108526 1,2
%A A108526 _Christian G. Bower_, Jun 07 2005