%I #23 Mar 11 2018 13:26:32
%S 1,1,5,10,10,5,1,1,35,370,1920,5835,11253,14240,11830,6230,1890,252,1,
%T 215,8830,148480,1352615,7665757,29224020,78518790,152794740,
%U 218270220,229279512,175227360,94864770,34504470,7567560,756756,1,1295,191890
%N This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,5). The p-th row (p>=1) contains a(i,p) for i=1 to 5*p-4, where a(i,p) satisfies Sum_{i=1..n} C(i+4,5)^p = 6 * C(n+5,6) * Sum_{i=1..5*p-4} a(i,p) * C(n-1,i-1)/(i+5).
%C From _Peter Bala_, Mar 11 2018: (Start)
%C The table entries T(n,k) are the coefficients when expressing the polynomial C(x+5,5)^p of degree 5*p in terms of falling factorials: C(x+5,5)^p = Sum_{k = 0..5*p} T(p,k)*C(x,k). It follows that Sum_{i = 0..n-1} C(i+5,5)^p = Sum_{k = 0..5*p} T(p,k)*C(n,k+1). (End)
%H G. C. Greubel, <a href="/A087109/b087109.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%H Dukes, C. D. White, <a href="http://arxiv.org/abs/1603.01589">Web Matrices: Structural Properties and Generating Combinatorial Identities</a>, arXiv:1603.01589 [math.CO], 2016.
%F a(i, p) = Sum_{k=1..[2*i+1+(-1)^(i-1)]/4} [ C(i-1, 2*k-2)*C(i-2*k+6, i-2*k+1)^(p-1) -C(i-1, 2*k-1)*C(i-2*k+5, i-2*k)^(p-1) ]
%F From _Peter Bala_, Mar 11 2018: (Start)
%F The following remarks assume the row and column indices start at 0.
%F T(n,k) = Sum_{i = 0..k} (-1)^(k-i)*binomial(k,i) * binomial(i+5,5)^n. Equivalently, let v_n denote the sequence (1, 6^n, 21^n, 56^n, ...) regarded as an infinite column vector, where 1, 6, 21, 56, ... is the sequence binomial(n+5,5) - see A000389. Then the n-th row of this table is determined by the matrix product P^(-1)*v_n, where P denotes Pascal's triangle A007318.
%F Recurrence: T(n+1,k) = Sum_{i = 0..5} C(5,i)*C(k+5-i,5)*T(n,k-i) with boundary conditions T(n,0) = 1 for all n and T(n,k) = 0 for k > 5*n.
%F n-th row polynomial R(n,x) = (1 + x)^5 o (1 + x)^5 o ... o (1 + x)^5 (n factors), where o denotes the black diamond product of power series defined in Dukes and White.
%F R(n+1,x) = 1/5!*(1 + x)^5 * (d/dx)^5(x^5*R(n,x)).
%F R(n,x) = Sum_{i >= 0} binomial(i+5,5)^n*x^i/(1 + x)^(i+1).
%F (1 - x)^(5*n)*R(n,x/(1 - x)) appears to equal the n-th row polynomial of A237202. (End)
%e Row 3 contains 1,35,370,...,252, so Sum_{i=1..n} C(i+4,5)^3 = 6 * C(n+5,6) * [ a(1,3)/6 + a(2,3)*C(n-1,1)/7 + a(3,3)*C(n-1,2)/8 + ... + a(11,3)*C(n-1,10)/16 ] = 6 * C(n+5,6) * [ 1/6 + 35*C(n-1,1)/7 + 370*C(n-1,2)/8 + ... + 252*C(n-1,10)/16 ]. Cf. A086026 for more details.
%e From _Peter Bala_, Mar 11 2018: (Start)
%e Table begins
%e 1
%e 1 5 10 10 5 1
%e 1 35 370 1920 5835 11253 14240 11830 6230 1890 252
%e ...
%e Row 2: C(i+5,5)^2 = C(i,0) + 35*C(i,1) + 370*C(i,2) + 1920*C(i,3) + 5835*C(i,4) + 11253*C(i,5) + 14240*C(i,6) + 11830*C(i,7) + 6230*C(i,8) + 1890*C(i,9) + 252*C(i,10). Hence, Sum_{i = 0..n-1} C(i+5,5)^2 = C(n,1) + 35*C(n,2) + 370*C(n,3) + 1920*C(n,4) + 5835*C(n,5) + 11253*C(n,6) + 14240*C(n,7) + 11830*C(n,8) + 6230*C(n,9) + 1890*C(n,10) + 252*C(n,11). (End)
%p seq(seq(add( (-1)^(k-i)*binomial(k, i)*binomial(i+5, 5)^n, i = 0..k), k = 0..5*n), n = 0..5); # _Peter Bala_, Mar 11 2018
%t a[i_, p_] := Sum[Binomial[i - 1, 2*k - 2]*Binomial[i - 2*k + 6, i - 2*k + 1]^(p - 1) - Binomial[i - 1, 2*k - 1]*Binomial[i - 2*k + 5, i - 2*k]^(p - 1), {k, 1, (2*i + 1 + (-1)^(i - 1))/4}]; Table[If[p == 1, 1, a[i, p]], {p, 1, 10}, {i, 1, 5*p - 4}]//Flatten (* _G. C. Greubel_, Nov 23 2017 *)
%o (PARI) {a(i, p) = sum(k=1, (2*i + 1 + (-1)^(i - 1))/4, binomial(i - 1, 2*k - 2)*binomial(i - 2*k + 6, i - 2*k + 1)^(p - 1) - binomial(i - 1, 2*k - 1)*binomial(i - 2*k + 5, i - 2*k)^(p - 1))}; for(p=1,8, for(i=1, 5*p-4, print1(if(p==1,1,a(i,p)), ", "))) \\ _G. C. Greubel_, Nov 23 2017
%Y Cf. A000292, A024166, A087127, A024166, A085438, A085439, A085440, A085441, A085442, A087107, A000332, A086020, A086021, A086022, A087108, A000389, A086023, A086024, A000579, A086025, A086026, A087110, A000580, A086027, A086028, A087111, A027555, A086029, A086030.
%Y Cf. A087127, A237202.
%K easy,nonn,tabf
%O 1,3
%A _André F. Labossière_, Aug 11 2003
%E Edited by _Dean Hickerson_, Aug 16 2003