The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A202948 a(n+1) = 3*A136016*a(n). 3

%I

%S -3,-72,-7560,-1814400,-778377600,-523069747200,-506854585036800,

%T -669048052248576000,-1154107890128793600000,

%U -2520571632041285222400000,-6797981691615346244812800000

%N a(n+1) = 3*A136016*a(n).

%C Sums of coefficients from (3n+2)th moments of binomial(m,k)*binomial(2m,k): see Maple code below.

%H Eric W. Weisstein, <a href="http://mathworld.wolfram.com/BinomialSums.html">MathWorld: Binomial Sums</a>

%F a(n)=-(1/6)*27^n*GAMMA(n-1/3)*GAMMA(n+1/3)*sqrt(3)/Pi.

%e The evaluation of sum(k^8 binomial(n,k) binomial(2n,k), k=0..n) involves the polynomial 64n^10 + 192n^9 - 1344n^8 - 1056n^7 + 8256n^6 - 3696n^5 - 9940n^4 + 7551n^3 + 348n^2 - 507n + 60, the sum of the coefficients of which is -72=a(2).

%p with(PolynomialTools); polyn := proc (q) options operator, arrow; 3^q*Pi*GAMMA(2*n)*(sum(k^q*binomial(n, k)*binomial(2*n, k), k = 0 .. n))/(27^n*sqrt(3)*GAMMA(n-floor((1/3)*q+1/3)+2/3)*GAMMA(n-floor((1/3)*q)+1/3)) end proc; coefl := proc (q) options operator, arrow; CoefficientList(expand(polyn(q)), n) end proc; coe := proc (j, h) options operator, arrow; coefl(j)[h] end proc; seq(sum(coe(3*r+2, k), k = 1 .. 5*r+3), r = 1 .. 8) ;

%o (PARI) print1(a=-3);for(n=2,20,print1(", ",a*=27*n*(n-2)+24)) \\ _Charles R Greathouse IV_, Dec 27 2011

%Y Cf. A136016, A064350.

%K sign,easy

%O 1,1

%A _John M. Campbell_, Dec 26 2011

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.

Last modified July 27 11:29 EDT 2021. Contains 346304 sequences. (Running on oeis4.)