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 A239201 #22 Nov 19 2021 09:26:03
%S A239201 2,5,17,68,293,1310,5984,27725,129773,612158,2905322,13857035,
%T A239201 66361892,318901523,1536964313,7426185908,35960185373,174468439958,
%U A239201 847920579938,4127211830363,20116566452918,98172213841553,479635277636543,2345731259059238,11482918774964588,56260052353307435,275862429353287079,1353641461527506630
%N A239201 Expansion of -(x * sqrt(5*x^2 -6*x +1) -2*x^3 +3*x^2 -x) / ((3*x^2 -4*x +1) * sqrt(5*x^2 -6*x +1) +5*x^3 -11*x^2 +7*x -1).
%F A239201 G.f. A(x) = G'(x)*(x*G(x)-x^2)/G(x)^2, where G(x) = A007317(x) = (sqrt(5*x^2-6*x+1)+x-1)/(2*x-2).
%F A239201 a(n) = [x^n] (F(x)^n-F(x)^(n-1)), where F(x) = (x^2-x-1)/(x-1).
%F A239201 a(n) = sum(k=1..n, binomial(n-1,n-k)*sum(i=0..n-k, binomial(k,n-k-i)*binomial(k+i-1,k-1)*2^(-n+2*k+i)*(-1)^(n-k-i))), n>0.
%F A239201 Conjecture D-finite with recurrence: (-n+1)*a(n) +(7*n-11)*a(n-1) +(-11*n+25)*a(n-2) +5*(n-3)*a(n-3)=0. - _R. J. Mathar_, Oct 07 2016
%F A239201 a(n) ~ 3 * 5^(n - 1/2) / (4*sqrt(Pi*n)). - _Vaclav Kotesovec_, Nov 19 2021
%o A239201 (Maxima)
%o A239201 a(n):=sum(binomial(n-1,n-k)*sum(binomial(k,n-k-i)*binomial(k+i-1,k-1)*2^(-n+2*k+i)*(-1)^(n-k-i),i,0,n-k),k,1,n);
%o A239201 (PARI) x='x+O('x^66); G=(sqrt(5*x^2-6*x+1)+x-1)/(2*x-2); Vec(G' * (x * G - x^2 ) / G^2) \\ _Joerg Arndt_, Mar 12 2014
%Y A239201 Cf. A007317.
%K A239201 nonn
%O A239201 1,1
%A A239201 _Vladimir Kruchinin_, Mar 12 2014