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 A108527 #15 Aug 11 2014 22:45:27
%S A108527 1,3,20,229,3764,80383,2107412,65436033,2347211812,95492023811,
%T A108527 4344109422388,218499395486909,12039757564700644,721239945304498215,
%U A108527 46669064731537444820,3243864647191662324601,241046155271316751794596
%N A108527 Number of labeled mobiles (cycle rooted trees) with n generators.
%C A108527 A generator is a leaf or a node with just one child.
%H A108527 Vaclav Kotesovec, <a href="/A108527/b108527.txt">Table of n, a(n) for n = 1..250</a>
%H A108527 <a href="/index/Mo#mobiles">Index entries for sequences related to mobiles</a>
%F A108527 E.g.f. satisfies: (2-x)*A(x) = x - 1 - log(1-A(x)).
%F A108527 a(n) ~ c * n^(n-1) / (exp(n) * r^n), where r = 0.20846306198165450115960050053484328028... and c = 0.3060161306524907981116283162103879... - _Vaclav Kotesovec_, Mar 28 2014
%t A108527 nmax=20; c[0]=0; A[x_]:=Sum[c[k]*x^k/k!,{k,0,nmax}]; Array[c,nmax]/.Solve[Rest[CoefficientList[Series[x-1-Log[1-A[x]]-(2-x)*A[x],{x,0,nmax}],x]]==0][[1]] (* _Vaclav Kotesovec_, Mar 28 2014 *)
%o A108527 (PARI) {a(n)=local(A=x+O(x^n)); for(i=0, n, A=intformal((1-A^2)/(1-x-2*A+x*A)+O(x^n))); n!*polcoeff(A, n)}
%o A108527 for(n=1, 20, print1(a(n), ", ")) \\ _Vaclav Kotesovec_, Mar 28 2014
%Y A108527 Cf. A108521-A108529, A038037, A032188.
%K A108527 nonn
%O A108527 1,2
%A A108527 _Christian G. Bower_, Jun 07 2005