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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237252 Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(6*n+1,i) * binomial(k+6-i,6)^n, 0 <= k <= 6*(n-1). 11
1, 1, 36, 225, 400, 225, 36, 1, 1, 324, 15606, 233300, 1424925, 4050864, 5703096, 4050864, 1424925, 233300, 15606, 324, 1, 1, 2376, 554931, 35138736, 879018750, 10490842656, 66555527346, 239677178256, 509723668476, 654019630000, 509723668476, 239677178256, 66555527346, 10490842656, 879018750, 35138736, 554931, 2376, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

In general, define b(k,e,p) = Sum_{i=0..k} (-1)^i*binomial(e*p+1,i)*binomial(k+e-i,e)^p. Then T(n,k) = b(k,6,n).

Using these coefficients we can obtain formulas for binomial(n,e)^p and for Sum_{i=1..n} binomial(e-1+i,e)^p.

In particular:

  binomial(n, e)^p = Sum_{k=0..e*(p-1)} b(k,e p) * binomial(n+k, e*p).

  Sum_{i=1..n} binomial(e-1+i, e)^p = Sum_{k=0..e*(p-1)} b(k,e,p) * binomial(n+e+k, e*p+1).

T(n,k) is the number of permutations of 6 indistinguishable copies of 1..n with exactly k descents. A descent is a pair of adjacent elements with the second element less than the first. - Andrew Howroyd, May 06 2020

LINKS

G. C. Greubel, Table of n, a(n) for the first 25 rows, flattened

FORMULA

Sum_{i=1..n} binomial(5+i,6)^p = Sum{k=0..6*(p-1)} T(p,k) * binomial(n+6+k, 6*p+1).

binomial(n,6)^p = Sum_{k=0..6*(p-1)} T(p,k) * binomial(n+k, 6*p).

EXAMPLE

For example :

T(n,0) = 1;

T(n,1) = 7^n - (6*n+1);

T(n,2) = 28^n - (6*n+1)*7^n + C(6*n+1,2);

T(n,3) = 84^n - (6*n+1)*28^n + C(6*n+1,2)*7^n + C(6*n+1,3);

T(n,4) = 210^n - (6*n+1)*84^n + C(6*n+1,2)*28^n - C(6*n+1,3)*7^n + C(6*n+1,4).

Triangle T(n,k) begins:

1;

1, 36, 225, 400, 225, 36, 1;

1, 324, 15606, 233300, 1424925, 4050864, 5703096, 4050864, 1424925, 233300, 15606, 324, 1;

1, 2376, 554931, 35138736, 879018750, 10490842656, 66555527346, 239677178256, 509723668476, 654019630000, 509723668476, 239677178256, 66555527346, 10490842656, 879018750, 35138736, 554931, 2376, 1;

1, 16776, 16689816, 3656408776, 286691702976, 10255094095176, 192698692565176, 2080037792142216, 13690633212385551, 57229721552316976, 156200093827061616, 283397584598631216, 345271537321293856, 283397584598631216, 156200093827061616, 57229721552316976,13690633212385551, 2080037792142216, 192698692565176, 10255094095176, 286691702976, 3656408776, 16689816, 16776, 1;

...

Example:

Sum_{i=1..n} C(5+i,6)^2 = A086027(n) = C(n+6,13) + 36*C(n+7,13) + 225*C(n+8,13) + 400*C(n+9,13) + 225*C(n+10,13) + 36*C(n+11,13) + C(n+12,13).

binomial(n,6)^2 = C(n,12) + 36*C(n+1,12) + 225*C(n+2,12) + 400*C(n+3,12) + 225*C(n+4,12) + 36*C(n+5,12) + C(n+6,12).

MATHEMATICA

b[k_, 6, p_] := Sum[(-1)^i*Binomial[6*p+1, i]*Binomial[k-i, 6]^p /. k -> 6+i, {i, 0, k-6}]; row[p_] := Table[b[k, 6, p], {k, 6, 6*p}]; Table[row[p], {p, 1, 5}] // Flatten (* Jean-Fran├žois Alcover, Feb 05 2014 *)

PROG

(PARI) T(n, k)={sum(i=0, k, (-1)^i*binomial(6*n+1, i)*binomial(k+6-i, 6)^n)} \\ Andrew Howroyd, May 06 2020

CROSSREFS

Columns k=2..6 are A151651, A151652, A151653, A151654, A151655.

Row sums are A248814.

Similar triangles for e=1..5: A173018 (or A008292), A154283, A174266, A236463, A237202.

Sum_{i=1..n} binomial(5+i,6)^p for p=1..3 gives: A000580, A086027, A086028.

Cf. A087127, A086023, A086024, A086025, A087107, A087108, A087109, A087110, A087111, A181544.

Sequence in context: A176696 A269031 A113164 * A017234 A112474 A166329

Adjacent sequences:  A237249 A237250 A237251 * A237253 A237254 A237255

KEYWORD

nonn,tabf

AUTHOR

Yahia Kahloune, Feb 05 2014

EXTENSIONS

Edited by Andrew Howroyd, May 06 2020

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 08:34 EDT 2021. Contains 343064 sequences. (Running on oeis4.)