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!)
A249891 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 * (-x)^k]. 2

%I #41 Nov 05 2023 09:58:15

%S 1,-1,-11,59,241,-3361,-419,172451,-575399,-7443481,58900909,

%T 216416771,-4229184959,2577683471,244556409709,-1057605544621,

%U -11063790445559,106391247022391,291287267857021,-7745138594921101,10707792104722681,449533741924068119,-2373288757544551451

%N 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 * (-x)^k].

%C The signs of the terms form a seemingly unpredictable pattern.

%C The sequence begins [1, 0, -1, 0, -11, 0, 59, 0, ...]. As is standard practice in the database, the zeros have been omitted.

%C Even order terms of the sequence (i.e., the nonzero ones) gives the diagonal of rational function 1/(1 - (x + y + x*z - y*z - x*y*z)). - _Gheorghe Coserea_, Aug 29 2018

%H Paul D. Hanna, <a href="/A249891/b249891.txt">Table of n, a(n) for n = 0..300</a>

%F G.f.: Sum_{n>=0} (-x)^n * Sum_{k=0..n} (-1)^k * C(n,k)^2 * Sum_{j=0..k} C(k,j)^2 * x^j = 1 - x^2 - 11*x^4 + 59*x^6 + 241*x^8 - ....

%F a(n) = Sum_{k=0..n} (-1)^k * Sum_{j=0..2*n-2*k} C(2*n-k, k+j)^2 * C(k+j, j)^2.

%F From _Peter Bala_, Mar 13 2018: (Start)

%F a(n) = Sum_{k = 0..n} (-1)^k*C(2*k,k)*C(n+k,n-k)^2.

%F n^2*(2*n-5)*a(n) = -( (2*n-5)*(2*n-1)^2*a(n-1) + (2*n-3)*(70*n^2-210*n+87)*a(n-2) + (2*n-1)*(2*n-5)^2*a(n-3) + (2*n-1)*(n-3)^2*a(n-4) ). (End)

%F a(n) = hypergeom([-n, -n, n + 1, n + 1], [1/2, 1, 1], -1/4). - _Peter Luschny_, Mar 14 2018

%F y = Sum_{n>=0} a(n)*x^n satisfies: 0 = 2*x*(x^4 + 4*x^3 + 70*x^2 + 4*x + 1)*y''' - (3*x^6 + 12*x^5 + 190*x^4 - 52*x^3 - 837*x^2 - 32*x - 4)*y'' - (9*x^5 + 24*x^4 + 166*x^3 - 106*x^2 - 947*x - 18)*y' - (3*x^4 + 3*x^3 - 67*x^2 - 29*x - 106)*y. - _Gheorghe Coserea_, Aug 29 2018

%F From _Mark van Hoeij_, Nov 04 2023: (Start)

%F a(n) = LegendreP(n, 2+sqrt(5)) * LegendreP(n, 2-sqrt(5)).

%F G.f.: hypergeom([1/4, 3/4],[1],-64*x^2/(x+1)^4)/(x+1). (End)

%e G.f.: A(x) = 1 - x^2 - 11*x^4 + 59*x^6 + 241*x^8 - 3361*x^10 - 419*x^12 + ...

%e where the g.f. is given by the series:

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

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

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

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

%e + 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*x + 10^2*x^2 - 10^2*x^3 + 5^2*x^4 - x^5) + ...

%e in which the coefficients of the odd powers of x vanish.

%e We can also express the g.f. by the series:

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

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

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

%e - x^5*(1 - 5^2*(1+x) + 10^2*(1+2^2*x+x^2) - 10^2*(1+3^2*x+3^2*x^2+x^3) + 5^2*(1+4^2*x+6^2*x^2+4^2*x^3+x^4) - (1+5^2*x+10^2*x^2+10^2*x^3+5^2*x^4+x^5)) + ...

%p seq(add((-1)^k*binomial(2*k,k)*binomial(n+k,n-k)^2, k = 0..n), n = 0..20); # _Peter Bala_, Mar 13 2018

%t a[n_] := HypergeometricPFQ[{-n, -n, n + 1, n + 1}, {1/2, 1, 1}, -1/4];Table[a[n], {n, 0, 22}] (* _Peter Luschny_, Mar 14 2018 *)

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

%o {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 * (-x)^k) +x*O(x^n)); polcoeff(A, n)}

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

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

%o {a(n)=polcoeff(sum(m=0, n, (-x)^m*sum(k=0, m, (-1)^k * binomial(m, k)^2 * sum(j=0, k, binomial(k, j)^2 * x^j) +x*O(x^n))), n)}

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

%o (PARI) /* Formula for a(2*n): */

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

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

%o (PARI)

%o seq(N) = {

%o my(a=vector(N), t1, t2); a[1]=-1; a[2]=-11; a[3]=59; a[4]=241;

%o for (n=5, N,

%o t1 = (2*n-5)*(2*n-1)^2*a[n-1] + (2*n-3)*(70*n^2-210*n+87)*a[n-2];

%o t2 = (2*n-1)*(2*n-5)^2*a[n-3] + (2*n-1)*(n-3)^2*a[n-4];

%o a[n] = -(t1 + t2)/(n^2*(2*n-5)));

%o concat(1,a);

%o };

%o seq(22)

%o \\ test: y=Ser(seq(303), 'x); 0 == 2*x*(x^4 + 4*x^3 + 70*x^2 + 4*x + 1)*y''' - (3*x^6 + 12*x^5 + 190*x^4 - 52*x^3 - 837*x^2 - 32*x - 4)*y'' - (9*x^5 + 24*x^4 + 166*x^3 - 106*x^2 - 947*x - 18)*y' - (3*x^4 + 3*x^3 - 67*x^2 - 29*x - 106)*y

%o \\ _Gheorghe Coserea_, Aug 29 2018

%Y Cf. A245925, A246056.

%K sign,easy

%O 0,3

%A _Paul D. Hanna_, Nov 07 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 19 02:28 EDT 2024. Contains 371782 sequences. (Running on oeis4.)