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!)
A246538 G.f.: Sum_{n>=0} 2^n * x^n / (1-x)^(2*n+1) * [Sum_{k=0..n} C(n,k)^2 * x^k]^2. 3

%I #20 Feb 24 2020 17:00:44

%S 1,3,15,87,559,3807,26919,195399,1445967,10859967,82527687,633165255,

%T 4896345487,38117454303,298435452135,2348094847047,18554434810831,

%U 147171478237695,1171272947140359,9349653181797063,74834845484454927,600441007306747167,4828337830880795943,38904633251921442375

%N G.f.: Sum_{n>=0} 2^n * x^n / (1-x)^(2*n+1) * [Sum_{k=0..n} C(n,k)^2 * x^k]^2.

%C a(n) == 1 (mod 3) iff n = 4*A005836(k) for k>=0, and a(n) == 0 (mod 3) otherwise, where A005836 gives numbers n whose base 3 representation contains no 2.

%F 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.

%F 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.

%F 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.

%F 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.

%F 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.

%F a(n) ~ ((3 + 4*sqrt(2) + sqrt(33+24*sqrt(2))))^n / (Pi *n * 2^(n+5/2)). - _Vaclav Kotesovec_, Nov 05 2014

%e G.f.: A(x) = 1 + 3*x + 15*x^2 + 87*x^3 + 559*x^4 + 3807*x^5 + 26919*x^6 +...

%e where

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

%e + 2^2*x^2/(1-x)^5*(1 + 2^2*x + x^2)^2

%e + 2^3*x^3/(1-x)^7*(1 + 3^2*x + 3^2*x^2 + x^3)^2

%e + 2^4*x^4/(1-x)^9*(1 + 4^2*x + 6^2*x^2 + 4^2*x^3 + x^4)^2

%e + 2^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 + 2^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 Table[Sum[2^k * Sum[Binomial[n-k, k+j]^2 * Binomial[k+j, j]^2 * 2^j,{j,0,n-2*k}],{k,0,Floor[n/2]}],{n,0,20}] (* _Vaclav Kotesovec_, Nov 05 2014 *)

%o (PARI) /* By definition: */

%o {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)}

%o for(n=0, 25, print1(a(n), ", "))

%o (PARI) /* By a binomial identity: */

%o {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)}

%o for(n=0, 25, print1(a(n), ", "))

%o (PARI) /* By a binomial identity: */

%o {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)}

%o for(n=0, 25, print1(a(n), ", "))

%o (PARI) /* By a binomial identity: */

%o {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)}

%o for(n=0, 25, print1(a(n), ", "))

%o (PARI) /* By a formula for a(n): */

%o {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))}

%o for(n=0, 25, print1(a(n), ", "))

%Y Cf. A246539, A246540, A246056, A246423, A243948, A245929, A227845, A245925, A005836.

%K nonn

%O 0,2

%A _Paul D. Hanna_, Aug 28 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)