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 A087111 #20 Mar 11 2018 13:27:44
%S A087111 1,1,7,21,35,35,21,7,1,1,63,1169,10703,58821,214123,545629,1004307,
%T A087111 1356194,1347318,974862,500346,172788,36036,3432,1,511,45633,1589567,
%U A087111 29302889,333924087,2577462937,14287393351,59159005164,188008120188
%N A087111 This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,7). The p-th row (p>=1) contains a(i,p) for i=1 to 7*p-6, where a(i,p) satisfies Sum_{i=1..n} C(i+6,7)^p = 8 * C(n+7,8) * Sum_{i=1..7*p-6} a(i,p) * C(n-1,i-1)/(i+7).
%C A087111 From _Peter Bala_, Mar 11 2018: (Start)
%C A087111 The table entries T(n,k) are the coefficients when expressing the polynomial C(x+7,7)^p of degree 7*p in terms of falling factorials: C(x+7,7)^p = Sum_{k = 0..7*p} T(p,k)*C(x,k). It follows that Sum_{i = 0..n-1} C(i+7,7)^p = Sum_{k = 0..7*p} T(p,k)*C(n,k+1). (End)
%H A087111 G. C. Greubel, <a href="/A087111/b087111.txt">Table of n, a(n) for the first 40 rows, flattebed</a>
%H A087111 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 A087111 a(i, p) = Sum_{k=1..[2*i+1+(-1)^(i-1)]/4} [ C(i-1, 2*k-2)*C(i-2*k+8, i-2*k+1)^(p-1) -C(i-1, 2*k-1)*C(i-2*k+7, i-2*k)^(p-1) ]
%F A087111 From _Peter Bala_, Mar 11 2018: (Start)
%F A087111 The following remarks assume the row and column indices start at 0.
%F A087111 T(n,k) = Sum_{i = 0..k} (-1)^(k-i)*binomial(k,i) * binomial(i+7,7)^n. Equivalently, let v_n denote the sequence (1, 8^n, 36^n, 120^n, ...) regarded as an infinite column vector, where 1, 8, 36, 120, ... is the sequence binomial(n+7,7) - see A000580. 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 A087111 Recurrence: T(n+1,k) = Sum_{i = 0..7} C(7,i)*C(k+7-i,7)*T(n,k-i) with boundary conditions T(n,0) = 1 for all n and T(n,k) = 0 for k > 7*n.
%F A087111 n-th row polynomial R(n,x) = (1 + x)^7 o (1 + x)^7 o ... o (1 + x)^7 (n factors), where o denotes the black diamond product of power series defined in Dukes and White.
%F A087111 R(n+1,x) = 1/7!*(1 + x)^7 * (d/dx)^7(x^7*R(n,x)).
%F A087111 R(n,x) = Sum_{i >= 0} binomial(i+7,7)^n*x^i/(1 + x)^(i+1).
%F A087111 (End)
%e A087111 Row 3 contains 1,63,1169,...,3432, so Sum_{i=1..n} C(i+6,7)^3 = 8 * C(n+7,8) * [ a(1,3)/8 + a(2,3)*C(n-1,1)/9 + a(3,3)*C(n-1,2)/10 + ... + a(15,3)*C(n-1,14)/22 ] = 8 * C(n+7,8) * [ 1/8 + 63*C(n-1,1)/9 + 1169*C(n-1,2)/10 + ... + 3432*C(n-1,14)/22 ]. Cf. A086030 for more details.
%p A087111 seq(seq(add( (-1)^(k-i)*binomial(k, i)*binomial(i+7, 7)^n, i = 0..k), k = 0..7*n), n = 0..4); # _Peter Bala_, Mar 11 2018
%t A087111 a[i_, p_] := Sum[Binomial[i - 1, 2*k - 2]*Binomial[i - 2*k + 8, i - 2*k + 1]^(p - 1) - Binomial[i - 1, 2*k - 1]*Binomial[i - 2*k + 7, 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, 7*p - 6}]//Flatten (* _G. C. Greubel_, Nov 23 2017 *)
%o A087111 (PARI) {a(i, p) = sum(k=1, (2*i + 1 + (-1)^(i - 1))/4, binomial(i - 1, 2*k - 2)*binomial(i - 2*k + 8, i - 2*k + 1)^(p - 1) - binomial(i - 1, 2*k - 1)*binomial(i - 2*k + 7, i - 2*k)^(p - 1))}; for(p=1,8, for(i=1, 7*p-6, print1(if(p==1,1,a(i,p)), ", "))) \\ _G. C. Greubel_, Nov 23 2017
%Y A087111 Cf. A000292, A024166, A087127, A024166, A085438, A085439, A085440, A085441, A085442, A087107, A000332, A086020, A086021, A086022, A087108, A000389, A086023, A086024, A087109, A000579, A086025, A086026, A087110, A000580, A086027, A086028, A027555, A086029, A086030, A087127.
%K A087111 easy,nonn,tabf
%O A087111 1,3
%A A087111 _André F. Labossière_, Aug 11 2003
%E A087111 Edited by _Dean Hickerson_, Aug 16 2003