|
FORMULA
|
G.f.: Sum_{n>=0} x^n / (1-2*x)^(2*n+1) * [Sum_{k=0..n} C(n,k)^2 * 2^k * x^k]^2.
G.f.: Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * 2^k * Sum_{j=0..k} C(k,j)^2 * x^j.
G.f.: Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * 2^(n-k) * Sum_{j=0..k} C(k,j)^2 * 2^j * x^j.
a(n) = Sum_{k=0..[n/2]} 2^k * Sum_{j=0..n-2*k} C(n-k, k+j)^2 * C(k+j, j)^2 * 2^j.
D-finite with recurrence: (n-4)*(n-1)^2*a(n) = 3*(n-4)*(3*n^2 - 9*n + 7)*a(n-1) - (n-2)*(n^2 - 6*n + 6)*a(n-2) - 3*(n-3)*(11*n^2 - 66*n + 92)*a(n-3) - 2*(n-4)*(n^2 - 6*n + 6)*a(n-4) + 12*(n-2)*(3*n^2 - 27*n + 61)*a(n-5) - 8*(n-5)^2*(n-2)*a(n-6). - Vaclav Kotesovec, Nov 05 2014, for offset 1.
a(n) ~ ((3 + 4*sqrt(2) + sqrt(33+24*sqrt(2))))^n / (Pi *n * 2^(n+5/2)). - Vaclav Kotesovec, Nov 05 2014
|
|
PROG
|
(PARI) /* By definition: */
{a(n)=local(A=1); A=sum(m=0, n, 2^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)}
for(n=0, 25, print1(a(n), ", "))
(PARI) /* By a binomial identity: */
{a(n)=local(A=1); A=sum(m=0, n, x^m/(1-2*x)^(2*m+1) * sum(k=0, m, binomial(m, k)^2 * 2^k * x^k)^2 +x*O(x^n)); polcoeff(A, n)}
for(n=0, 25, print1(a(n), ", "))
(PARI) /* By a binomial identity: */
{a(n)=polcoeff(sum(m=0, n, x^m*sum(k=0, m, binomial(m, k)^2 * 2^k * sum(j=0, k, binomial(k, j)^2 * x^j)+x*O(x^n))), n)}
for(n=0, 25, print1(a(n), ", "))
(PARI) /* By a binomial identity: */
{a(n)=polcoeff(sum(m=0, n, x^m*sum(k=0, m, binomial(m, k)^2 * 2^(m-k) * sum(j=0, k, binomial(k, j)^2 * 2^j * x^j)+x*O(x^n))), n)}
for(n=0, 25, print1(a(n), ", "))
(PARI) /* By a formula for a(n): */
{a(n)=sum(k=0, n\2, sum(j=0, n-2*k, 2^k * binomial(n-k, k+j)^2 * binomial(k+j, j)^2 * 2^j))}
for(n=0, 25, print1(a(n), ", "))
|