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 A137968 #10 Mar 03 2018 13:52:42
%S A137968 1,1,6,27,158,981,6342,42728,295008,2079882,14908740,108312873,
%T A137968 795836544,5903472999,44151306690,332552305818,2520416719368,
%U A137968 19207222744326,147086508325056,1131292622149352,8735383810590486
%N A137968 G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^2)^6.
%H A137968 Vaclav Kotesovec, <a href="/A137968/b137968.txt">Table of n, a(n) for n = 0..400</a>
%F A137968 G.f.: A(x) = 1 + x*B(x)^6 where B(x) is the g.f. of A137967.
%F A137968 a(n) = Sum_{k=0..n-1} C(6*(n-k),k)/(n-k) * C(2*k,n-k-1) for n>0 with a(0)=1. - _Paul D. Hanna_, Jun 16 2009
%F A137968 a(n) ~ sqrt(6*s*(1-s)*(2-3*s) / ((44*s - 24)*Pi)) / (n^(3/2) * r^n), where r = 0.1201742080825038015263858974579392344239858277873... and s = 1.572098697306844482137442690518486437859864764710... are real roots of the system of equations s = 1 + r*(1 + r*s^2)^6, 12 * r^2 * s * (1 + r*s^2)^5 = 1. - _Vaclav Kotesovec_, Nov 22 2017
%o A137968 (PARI) {a(n)=local(A=1+x*O(x^n));for(i=0,n,A=1+x*(1+x*A^2)^6);polcoeff(A,n)}
%o A137968 (PARI) a(n)=if(n==0,1,sum(k=0,n-1,binomial(6*(n-k),k)/(n-k)*binomial(2*k,n-k-1))) \\ _Paul D. Hanna_, Jun 16 2009
%Y A137968 Cf. A137967, A137969; A137970, A137972, A137974.
%K A137968 nonn
%O A137968 0,3
%A A137968 _Paul D. Hanna_, Feb 26 2008