|
|
FORMULA
|
G.f.: Sum_{n>=0} x^n / (1-3*x)^(2*n+1) * [Sum_{k=0..n} C(n,k)^2 * 3^k * x^k]^2.
G.f.: Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * 3^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 * 3^(n-k) * Sum_{j=0..k} C(k,j)^2 * 3^j * x^j.
a(n) = Sum_{k=0..[n/2]} 3^k * Sum_{j=0..n-2*k} C(n-k, k+j)^2 * C(k+j, j)^2 * 3^j.
Recurrence: (n-3)*n^2*a(n) = 4*(n-3)*(3*n^2 - 3*n + 1)*a(n-1) - 3*(n-1)*(3*n^2 - 12*n + 8)*a(n-2) - 8*(n-2)*(7*n^2 - 28*n + 24)*a(n-3) - 9*(n-3)*(3*n^2 - 12*n + 8)*a(n-4) + 36*(n-1)*(3*n^2 - 21*n + 37)*a(n-5) - 27*(n-4)^2*(n-1)*a(n-6). - Vaclav Kotesovec, Nov 05 2014
a(n) ~ sqrt(3) * (2 + 2*sqrt(3) + sqrt(13+8*sqrt(3)))^(n+1) / (12*Pi*n). - Vaclav Kotesovec, Nov 05 2014
|
|
|
PROG
|
(PARI) /* By definition: */
{a(n)=local(A=1); A=sum(m=0, n, 3^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-3*x)^(2*m+1) * sum(k=0, m, binomial(m, k)^2 * 3^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 * 3^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 * 3^(m-k) * sum(j=0, k, binomial(k, j)^2 * 3^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, 3^k * binomial(n-k, k+j)^2 * binomial(k+j, j)^2 * 3^j))}
for(n=0, 25, print1(a(n), ", "))
|
