This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A204820 #7 Feb 16 2025 08:33:16 %S A204820 8,-192,161280,-638668800,6974263296000,-162193467211776000, %T A204820 6893871130369327104000,-483949753351926762700800000, %U A204820 52208499391605859160162304000000,-8200911084433448356878294712320000000 %N A204820 a(n) = -4*a(n-1)*A001505(n-2), with a(1)=8. %C A204820 Sums of coefficients from (4n+1)th moments of binomial(m,k) * binomial(3*m,k); see Maple code below. %H A204820 Eric W. Weisstein, <a href="https://mathworld.wolfram.com/BinomialSums.html">MathWorld: Binomial Sums</a> %H A204820 <a href="/index/Di#divseq">Index to divisibility sequences</a> %F A204820 a(n)=-(1/8)*GAMMA(2*n-3/2)*GAMMA(n-1/2)*(-1)^n*64^n/Pi %e A204820 The evaluation of sum(binomial(n, k)*binomial(3*n, k)*k^9, k=0..n) involves the polynomial 2187*n^11+6561*n^10-45927*n^9-28431*n^8+322947*n^7-257985*n^6-473445*n^5+726003*n^4-110482*n^3-189924*n^2+52624*n-4320, the sum of the coefficients of which is -192 = a(2). %p A204820 with(PolynomialTools); polyn:=q->expand(simplify((1/(GAMMA(n-((2*floor((q+1)/4)-1))/(2))))*(1/sqrt(3))*GAMMA(n+1/3)*GAMMA(n+2/3)*(1/3)*(1/(27^(-n)))*GAMMA(n)*1/64^n*sum(binomial(n, k)*binomial(3*n, k)*k^q, k=0..n)*(1/(GAMMA(2*n-((2*floor(q/2)-1)/(2)))))*(2^((floor((1/2)*q+1/2)-1)+q)))); coefl:=h->CoefficientList(expand(polyn(h)), n); coe:=(d, b)->coefl(d)[b];seq(sum(coe((4*d+1),b),b=1..(4*d+1)+floor(((4*d+1)+1)/4)+floor((4*d+1)/2)),d=1..6);seq(-(1/8)*GAMMA(2*n-3/2)*GAMMA(n-1/2)*(-1)^n*64^n/Pi,n=1..6); %Y A204820 Cf. A203778, A015219, A202948, A202946. %K A204820 easy,sign %O A204820 1,1 %A A204820 _John M. Campbell_, Jan 19 2012