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 A246540 #9 Nov 05 2014 16:43:11
%S A246540 1,5,37,325,3125,31925,339077,3700645,41200981,465736725,5328229797,
%T A246540 61552244485,716791570549,8403794763125,99096946864325,
%U A246540 1174370518273125,13977636401394069,167001257979441365,2002052157653251557,24073717683854557125,290261630170911545525,3508332484300450371125
%N A246540 G.f.: Sum_{n>=0} 4^n * x^n / (1-x)^(2*n+1) * [Sum_{k=0..n} C(n,k)^2 * x^k]^2.
%C A246540 a(n) == 5 (mod 16) for n>=1.
%F A246540 G.f.: Sum_{n>=0} x^n / (1-4*x)^(2*n+1) * [Sum_{k=0..n} C(n,k)^2 * 4^k * x^k]^2.
%F A246540 G.f.: Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * 4^k * Sum_{j=0..k} C(k,j)^2 * x^j.
%F A246540 G.f.: Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * 4^(n-k) * Sum_{j=0..k} C(k,j)^2 * 4^j * x^j.
%F A246540 a(n) = Sum_{k=0..[n/2]} 4^k * Sum_{j=0..n-2*k} C(n-k, k+j)^2 * C(k+j, j)^2 * 4^j.
%F A246540 Recurrence: (n-3)*n^2*a(n) = 5*(n-3)*(3*n^2 - 3*n + 1)*a(n-1) - (n-1)*(23*n^2 - 92*n + 65)*a(n-2) - 5*(n-2)*(15*n^2 - 60*n + 53)*a(n-3) - 4*(n-3)*(23*n^2 - 92*n + 65)*a(n-4) + 80*(n-1)*(3*n^2 - 21*n + 37)*a(n-5) - 64*(n-4)^2*(n-1)*a(n-6). - _Vaclav Kotesovec_, Nov 05 2014
%F A246540 a(n) ~ ((13+3*sqrt(17))/2)^(n+1) / (8*Pi*n). - _Vaclav Kotesovec_, Nov 05 2014
%e A246540 G.f.: A(x) = 1 + 5*x + 37*x^2 + 325*x^3 + 3125*x^4 + 31925*x^5 +...
%e A246540 where
%e A246540 A(x) = 1/(1-x) + 4*x/(1-x)^3*(1+x)^2
%e A246540 + 4^2*x^2/(1-x)^5*(1 + 2^2*x + x^2)^2
%e A246540 + 4^3*x^3/(1-x)^7*(1 + 3^2*x + 3^2*x^2 + x^3)^2
%e A246540 + 4^4*x^4/(1-x)^9*(1 + 4^2*x + 6^2*x^2 + 4^2*x^3 + x^4)^2
%e A246540 + 4^5*x^5/(1-x)^11*(1 + 5^2*x + 10^2*x^2 + 10^2*x^3 + 5^2*x^4 + x^5)^2
%e A246540 + 4^6*x^6/(1-x)^13*(1 + 6^2*x + 15^2*x^2 + 20^2*x^3 + 15^2*x^4 + 6^2*x^5 + x^6)^2 +...
%t A246540 Table[Sum[4^k * Sum[Binomial[n-k, k+j]^2 * Binomial[k+j, j]^2 * 4^j,{j,0,n-2*k}],{k,0,Floor[n/2]}],{n,0,20}] (* _Vaclav Kotesovec_, Nov 05 2014 *)
%o A246540 (PARI) /* By definition: */
%o A246540 {a(n)=local(A=1); A=sum(m=0, n, 4^m*x^m/(1-x)^(2*m+1) * sum(k=0, m, binomial(m, k)^2 * x^k)^2 +x*O(x^n)); polcoeff(A, n)}
%o A246540 for(n=0, 25, print1(a(n), ", "))
%o A246540 (PARI) /* By a binomial identity: */
%o A246540 {a(n)=local(A=1); A=sum(m=0, n, x^m/(1-4*x)^(2*m+1) * sum(k=0, m, binomial(m, k)^2 * 4^k * x^k)^2 +x*O(x^n)); polcoeff(A, n)}
%o A246540 for(n=0, 25, print1(a(n), ", "))
%o A246540 (PARI) /* By a binomial identity: */
%o A246540 {a(n)=polcoeff(sum(m=0, n, x^m*sum(k=0, m, binomial(m, k)^2 * 4^k * sum(j=0, k, binomial(k, j)^2 * x^j)+x*O(x^n))), n)}
%o A246540 for(n=0, 25, print1(a(n), ", "))
%o A246540 (PARI) /* By a binomial identity: */
%o A246540 {a(n)=polcoeff(sum(m=0, n, x^m*sum(k=0, m, binomial(m, k)^2 * 4^(m-k) * sum(j=0, k, binomial(k, j)^2 * 4^j * x^j)+x*O(x^n))), n)}
%o A246540 for(n=0, 25, print1(a(n), ", "))
%o A246540 (PARI) /* By a formula for a(n): */
%o A246540 {a(n)=sum(k=0, n\2, sum(j=0, n-2*k, 4^k * binomial(n-k, k+j)^2 * binomial(k+j, j)^2 * 4^j))}
%o A246540 for(n=0, 25, print1(a(n), ", "))
%Y A246540 Cf. A246538, A246539, A246056, A246423, A243948, A245929, A227845, A245925.
%K A246540 nonn
%O A246540 0,2
%A A246540 _Paul D. Hanna_, Aug 28 2014