login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243948 G.f.: Sum_{n>=0} x^n / (1-x)^(2*n+1) * [Sum_{k=0..n} C(n,k)^2 * x^k] * [Sum_{k=0..n} C(n,k)^2 * 2^k * x^k]. 10
1, 2, 8, 36, 182, 964, 5296, 29832, 171238, 997244, 5874992, 34937400, 209392796, 1263258760, 7664233696, 46726270992, 286089651718, 1758215706476, 10841476837424, 67049791851672, 415784950498964, 2584585251386296, 16101542183281312, 100511325748165488, 628579719997550044 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Paul D. Hanna, Table of n, a(n) for n = 0..400

FORMULA

G.f.: Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * Sum_{j=0..k} C(k,j)^2 * 2^j * x^j.

a(n) = Sum_{k=0..[n/2]} Sum_{j=0..n-2*k} C(n-k, k+j)^2 * C(k+j, k)^2 * 2^k.

Recurrence: (n-3)*(n-2)*n^2*a(n) = 2*(n-3)*(4*n^3 - 12*n^2 + 10*n - 3)*a(n-1) - 2*(n-1)*(5*n^3 - 30*n^2 + 58*n - 38)*a(n-2) + 8*(n-2)*a(n-3) + 4*(n-3)*(5*n^3 - 30*n^2 + 58*n - 34)*a(n-4) - 8*(n-1)*(4*n^3 - 36*n^2 + 106*n - 101)*a(n-5) + 8*(n-4)^2*(n-2)*(n-1)*a(n-6). - Vaclav Kotesovec, Aug 17 2014

a(n) ~ sqrt(c) * d^n / (2^(3/2)*Pi*n), where d = 2 + sqrt(2) + 2*sqrt(1+sqrt(2)) = 6.52176151043316966349... is the root of the equation 4 - 16*d + 12*d^2 - 8*d^3 + d^4 = 0, and c = 4 + 5/sqrt(2) + 2*sqrt(7+5*sqrt(2)) = 15.0378183078640521... is the root of the equation 1 - 32*c + 60*c^2 - 64*c^3 + 4*c^4 = 0. - Vaclav Kotesovec, Aug 17 2014

EXAMPLE

G.f.: A(x) = 1 + 2*x + 8*x^2 + 36*x^3 + 182*x^4 + 964*x^5 + 5296*x^6 +...

where the g.f. is given by the binomial series:

A(x) = 1/(1-x) + x/(1-x)^3*(1+x) * (1+2*x)

+ x^2/(1-x)^5*(1 + 2^2*x + x^2) * (1 + 2^2*2*x + 4*x^2)

+ x^3/(1-x)^7*(1 + 3^2*x + 3^2*x^2 + x^3) * (1 + 3^2*2*x + 3^2*4*x^2 + 8*x^3)

+ x^4/(1-x)^9*(1 + 4^2*x + 6^2*x^2 + 4^2*x^3 + x^4) * (1 + 4^2*2*x + 6^2*4*x^2 + 4^2*8*x^3 + 16*x^4)

+ x^5/(1-x)^11*(1 + 5^2*x + 10^2*x^2 + 10^2*x^3 + 5^2*x^4 + x^5) * (1 + 5^2*2*x + 10^2*4*x^2 + 10^2*8*x^3 + 5^2*16*x^4 + 32*x^5) +...

We can also express the g.f. by the binomial series identity:

A(x) = 1 + x*(1 + (1+2*x)) + x^2*(1 + 2^2*(1+2*x) + (1+2^2*2*x+4*x^2))

+ x^3*(1 + 3^2*(1+2*x) + 3^2*(1+2^2*2*x+4*x^2) + (1+3^2*2*x+3^2*4*x^2+8*x^3))

+ x^4*(1 + 4^2*(1+2*x) + 6^2*(1+2^2*2*x+4*x^2) + 4^2*(1+3^2*2*x+3^2*4*x^2+8*x^3) + (1+4^2*2*x+6^2*4*x^2+4^2*8*x^3+16*x^4))

+ x^5*(1 + 5^2*(1+2*x) + 10^2*(1+2^2*2*x+4*x^2) + 10^2*(1+3^2*2*x+3^2*4*x^2+8*x^3) + 5^2*(1+4^2*2*x+6^2*4*x^2+4^2*8*x^3+16*x^4) + (1+5^2*2*x+10^2*4*x^2+10^2*8*x^3+5^2*16*x^4+32*x^5)) +...

PROG

(PARI) /* By definition: */

{a(n)=local(A=1); A=sum(m=0, n, x^m/(1-x)^(2*m+1) * sum(k=0, m, binomial(m, k)^2*x^k) * sum(k=0, m, binomial(m, k)^2*2^k*x^k) +x*O(x^n)); polcoeff(A, n)}

for(n=0, 30, 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*sum(j=0, k, binomial(k, j)^2*2^j*x^j)+x*O(x^n))), n)}

for(n=0, 30, print1(a(n), ", "))

(PARI) /* Formula for a(n): */

{a(n)=sum(k=0, n\2, sum(j=0, n-2*k, binomial(n-k, k+j)^2*binomial(k+j, k)^2*2^k))}

for(n=0, 30, print1(a(n), ", "))

CROSSREFS

Cf. A246455 (dual), A245929, A227845, A245925.

Sequence in context: A285672 A081958 A316663 * A001540 A129044 A052582

Adjacent sequences:  A243945 A243946 A243947 * A243949 A243950 A243951

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Aug 16 2014

EXTENSIONS

Minor edits by Vaclav Kotesovec, Nov 05 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 03:58 EST 2022. Contains 350473 sequences. (Running on oeis4.)