A111808 -id:A111808 - cp's OEIS frontend

A213744 Triangle of numbers C^(5)(n,k) of combinations with repetitions from n different elements over k for each of them not more than 5 appearances allowed.

1, 1, 1, 1, 2, 3, 1, 3, 6, 10, 1, 4, 10, 20, 35, 1, 5, 15, 35, 70, 126, 1, 6, 21, 56, 126, 252, 456, 1, 7, 28, 84, 210, 462, 917, 1667, 1, 8, 36, 120, 330, 792, 1708, 3368, 6147, 1, 9, 45, 165, 495, 1287, 2994, 6354, 12465, 22825, 1, 10

Offset: 0

Vladimir Shevelev and Peter J. C. Moses, Jun 19 2012

For k<=4, the triangle coincides with triangle A213743.

We have over columns of the triangle: T(n,0)=1, T(n,1)=n, T(n,2)=A000217(n) for n>1, T(n,3)=A000292(n) for n>=3, T(n,4)=A000332(n) for n>=7, T(n,5)=A000389(n) for n>=9, T(n,6)=A062989(n) for n>=5, T(n,7)=A063262 for n>=5, T(n,8)=A063263 for n>=6, T(n,9)=A063264 for n>=7.

			Triangle begins
n/k.|..0.....1.....2.....3.....4.....5.....6.....7
==================================================
.0..|..1
.1..|..1.....1
.2..|..1.....2.....3
.3..|..1.....3.....6....10
.4..|..1.....4....10....20....35
.5..|..1.....5....15....35....70....126
.6..|..1.....6....21....56...126....252...456
.7..|..1.....7....28....84...210....462...917....1667

Peter J. C. Moses, Rows n = 0..50 of triangle, flattened

Cf. A007318, A005725, A111808, A187925, A213742, A213743, A000217, A000292, A000332, A000389, A062989, A063262, A063263, A063264.

Flatten[Table[Sum[(-1)^r Binomial[n,r] Binomial[n-# r+k-1,n-1],{r,0,Floor[k/#]}],{n,0,15},{k,0,n}]/.{0}->{1}]&[6] (* Peter J. C. Moses, Apr 16 2013 *)

C^(5)(n,k)=sum{r=0,...,floor(k/6)}(-1)^r*C(n,r)*C(n-6*r+k-1, n-1)

A213745 Triangle of numbers C^(6)(n,k) of combinations with repetitions from n different elements over k for each of them not more than 6 appearances allowed.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 1, 3, 6, 10, 1, 4, 10, 20, 35, 1, 5, 15, 35, 70, 126, 1, 6, 21, 56, 126, 252, 462, 1, 7, 28, 84, 210, 462, 924, 1709, 1, 8, 36, 120, 330, 792, 1716, 3424, 6371, 1, 9, 45, 165, 495, 1287, 3003, 6426, 12789, 23905, 1, 10

Offset: 0

Vladimir Shevelev and Peter J. C. Moses, Jun 19 2012

For k<=5, the triangle coincides with triangle A213744.

We have over columns of the triangle: T(n,0)=1, T(n,1)=n, T(n,2)=A000217(n) for n>1, T(n,3)=A000292(n) for n>=3, T(n,4)=A000332(n) for n>=7, T(n,5)=A000389(n) for n>=9, T(n,6)=A000579(n) for n>=11, T(n,7)=A063267 for n>=5, T(n,8)=A063417 for n>=6, T(n,9)=A063418 for n>=7.

			Triangle begins
n/k.|..0.....1.....2.....3.....4.....5.....6.....7
==================================================
.0..|..1
.1..|..1.....1
.2..|..1.....2.....3
.3..|..1.....3.....6....10
.4..|..1.....4....10....20....35
.5..|..1.....5....15....35....70....126
.6..|..1.....6....21....56...126....252...462
.7..|..1.....7....28....84...210....462...924....1709

Peter J. C. Moses, Rows n = 0..50 of triangle, flattened

Cf. A007318, A005725, A059481, A111808, A187925, A213742, A213743, A213744, A000217, A000292, A000332, A000389, A000579, A063267, A063417, A063418.

Flatten[Table[Sum[(-1)^r Binomial[n,r] Binomial[n-# r+k-1,n-1],{r,0,Floor[k/#]}],{n,0,15},{k,0,n}]/.{0}->{1}]&[7] (* Peter J. C. Moses, Apr 16 2013 *)

C^(6)(n,k)=sum{r=0,...,floor(k/7)}(-1)^r*C(n,r)*C(n-7*r+k-1, n-1).
A generalization. The numbers C^(t)(n,k) of combinations with repetitions from n different elements over k, for each of them not more than t>=1 appearances allowed, are enumerated by the formula:
C^(t)(n,k)=sum{r=0,...,floor(k/(t+1))}(-1)^r*C(n,r)*C(n-(t+1)*r+k-1, n-1).
In case t=1, it is binomial coefficient C^(t)(n,k)=C(n,k), and we have the combinatorial identity: sum{r=0,...,floor(k/2)}(-1)^r*C(n,r)*C(n-2*r+k-1, n-1)=C(n,k). On the other hand, if t=n, then r=0, and for the corresponding numbers of combinations with repetitions without a restriction on appearances of elements we obtain a well known formula C(n+k-1, n-1) (cf. triangle A059481).
In addition, note that, if k<=t, then C^(t)(n,k)=C(n+k-1, n-1). Therefore, triangle {C^(t+1)(n,k)} coincides with the previous triangle {C^(t)(n,k)} for k<=t.

A064054 Tenth column of trinomial coefficients.

Original entry on oeis.org

5, 50, 266, 1016, 3139, 8350, 19855, 43252, 87802, 168168, 306735, 536640, 905658, 1481108, 2355962, 3656360, 5550755, 8260934, 12075184, 17363896, 24597925, 34370050, 47419905, 64662780, 87222720, 116470380, 154066125, 202008896, 262691396, 338962184

Offset: 0

Wolfdieter Lang, Aug 29 2001

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (10,-45,120,-210,252,-210,120,-45,10,-1).

A005716 (ninth column), A111808.

A064054 := n -> GegenbauerC(`if`(9A064054(n)), n=5..20); # Peter Luschny, May 10 2016

Table[GegenbauerC[9, -n, -1/2], {n,5,50}] (* G. C. Greubel, Feb 28 2017 *)

for(n=0,25, print1(binomial(n+5,5)*(n^4 + 66*n^3 + 1307*n^2 + 8706*n + 15120) /(9!/5!), ", ")) \\ G. C. Greubel, Feb 28 2017

a(n) = A027907(n+5, 9).
a(n) = binomial(n+5, 5)*(n^4+66*n^3+1307*n^2+8706*n+15120) /(9!/5!).
G.f.: (1+x-x^2)*(5-5*x+x^2)/(1-x)^10, numerator polynomial is N3(9, x)= 5+0*x-9*x^2+6*x^3-x^4 from array A063420.
a(n) = A111808(n+5,9) for n>3. - Reinhard Zumkeller, Aug 17 2005
a(n) = 5*binomial(n+5,5) + 20*binomial(n+5,6) + 21*binomial(n+5,7) + 8*binomial(n+5,8) + binomial(n+5,9) (see our comment in A026729). - Vladimir Shevelev and Peter J. C. Moses, Jun 22 2012
a(n) = GegenbauerC(N, -n, -1/2) where N = 9 if 9Peter Luschny, May 10 2016

A114929 Array read by antidiagonals: consider a semi-infinite chessboard with squares labeled (i,j), i >= 0, j >= 0; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 4, 2, 2, 4, 9, 5, 1, 5, 9, 21, 12, 3, 3, 12, 21, 51, 30, 9, 1, 9, 30, 51, 127, 76, 25, 4, 4, 25, 76, 127, 323, 196, 69, 14, 1, 14, 69, 196, 323, 835, 512, 189, 44, 5, 5, 44, 189, 512, 835, 2188, 1353, 518, 133, 20, 1, 20, 133, 518, 1353, 2188, 5798, 3610, 1422

Offset: 0

N. J. A. Sloane, based on May 27 2005 email from Harrie Grondijs, Feb 27 2006

			Array begins:
1 1 2 4 9 21 51 ...
1 1 2 5 12 30 ...
2 2 1 3 9 25 ...
4 5 3 1 4 14 ...
...

Harrie Grondijs, Neverending Quest of Type C, Volume B - the endgame study-as-struggle.

Cf. A026300, A020474, A111808, A114972.

Equals Motzkin triangle (A026300) next to same triangle reflected in mirror. See A026300 for the obvious recurrence.

More terms from Joshua Zucker, May 20 2006

T(0,0) corrected by Johannes W. Meijer, Oct 07 2010

A114972 Array read by antidiagonals: consider a doubly infinite chessboard with squares labeled (i,j), i in Z, j in Z; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).

Original entry on oeis.org

1, 1, 1, 3, 1, 3, 7, 2, 2, 7, 19, 6, 1, 6, 19, 51, 16, 3, 3, 16, 51, 141, 45, 10, 1, 10, 45, 141, 393, 126, 30, 4, 4, 30, 126, 393, 1107, 357, 90, 15, 1, 15, 90, 357, 1107, 3139, 1016, 266, 50, 5, 5, 50, 266, 1016, 3139, 8953, 2907, 784, 161, 21, 1, 21, 161, 784, 2907

Offset: 0

N. J. A. Sloane, based on May 27 2005 email from Harrie Grondijs, Feb 27 2006

			Array begins:
1 1 3 7 19 ...
1 1 2 6 ...
3 2 1 3 ...
7 6 3 1 ...
...

Harrie Grondijs, Neverending Quest of Type C, Volume B - the endgame study-as-struggle.

Cf. A111808, A026300, A114929.

Equals triangle A111808 next to same triangle reflected in mirror. See A111808 for obvious recurrence.

More terms from Joshua Zucker, May 20 2006

T(0,0) corrected by Johannes W. Meijer, Oct 05 2010

A098470 Form array in which n-th row is obtained by expanding (1+x+x^2)^n and taking the 5th column from the center.

Original entry on oeis.org

1, 6, 28, 112, 414, 1452, 4917, 16236, 52624, 168168, 531531, 1665456, 5182008, 16031952, 49366674, 151419816, 462919401, 1411306358, 4292487562, 13029127584, 39478598170, 119439969220, 360881425710, 1089126806040

Offset: 5

Eric W. Weisstein, Sep 09 2004

nonn

G. C. Greubel, Table of n, a(n) for n = 5..1005
Eric Weisstein's World of Mathematics, Trinomial Coefficient

Cf. A002426, A005717, A014531, A014532, A014533.

# Assuming offset 0:
a := n -> simplify(GegenbauerC(n, -n-5, -1/2)):
seq(a(n), n=0..25); # Peter Luschny, May 09 2016

Table[GegenbauerC[n, -n - 5, -1/2], {n,0,50}] (* G. C. Greubel, Feb 28 2017 *)

x='x + O('x^50); Vec(32*x^5/(sqrt((1+x)*(1-3*x))*(1-x-sqrt((1+x)*(1-3*x)))^5)) \\ G. C. Greubel, Feb 28 2017

(n^2-25)*a(n) = n*(2*n-1)*a(n-1) + 3*n*(n-1)*a(n-2). - Vladeta Jovovic, Sep 18 2004
G.f.: 32*x^5/(sqrt((1+x)*(1-3*x))*(1-x-sqrt((1+x)*(1-3*x)))^5). - Vladeta Jovovic, Sep 18 2004
a(n) = A111808(n,n-5). - Reinhard Zumkeller, Aug 17 2005
Assuming offset 0: a(n) = GegenbauerC(n,-n-5,-1/2) and a(n) = binomial(10+2*n,n)* hypergeom([-n, -n-10], [-9/2-n], 1/4). - Peter Luschny, May 09 2016
a(n) ~ 3^(n + 1/2) / (2*sqrt(Pi*n)). - Vaclav Kotesovec, Nov 09 2021

A178618 Triangle T(n,k) with the coefficient [x^k] of the series (1-x)^(n+1) * sum_{j=0..infinity} binomial(n+3j,3j)x^j, in row n, column k.

Original entry on oeis.org

1, 1, 2, 1, 7, 1, 1, 16, 10, 1, 30, 45, 5, 1, 50, 141, 50, 1, 1, 77, 357, 266, 28, 1, 112, 784, 1016, 266, 8, 1, 156, 1554, 3139, 1554, 156, 1, 1, 210, 2850, 8350, 6765, 1452, 55, 1, 275, 4917, 19855, 24068, 9042, 880, 11

Offset: 0

Roger L. Bagula, May 30 2010

Every third row is symmetrical.
Row sums are 3^n.
2*k instead of 3*k in the binomial() gives A034839 with alternating rows of A086645.

			1;
1, 2;
1, 7, 1;
1, 16, 10;
1, 30, 45, 5;
1, 50, 141, 50, 1;
1, 77, 357, 266, 28;
1, 112, 784, 1016, 266, 8;
1, 156, 1554, 3139, 1554, 156, 1;
1, 210, 2850, 8350, 6765, 1452, 55;
1, 275, 4917, 19855, 24068, 9042, 880, 11;

Cf. A094531, A111808, A027907.

A178618 := proc(n,k)
    (1-x)^(n+1)*add( binomial(n+3*j,3*j)*x^j,j=0..n+1) ;
    coeftayl(%,x=0,k) ;
end proc:
seq(seq(A178618(n,k),k=0..n),n=0..8) ; # R. J. Mathar, Nov 05 2012

p[x_, n_] = (-1)^(n + 1)*(-1 + x)^(n + 1)*Sum[Binomial[n + 3*k, 3*k]*x^k, {k, 0, Infinity}]
Flatten[Table[CoefficientList[FullSimplify[ExpandAll[p[x, n]]], x], {n, 0, 10}]]

A213808 Triangle of numbers C^(7)(n,k) of combinations with repetitions from n different elements over k for each of them not more than 7 appearances allowed.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 1, 3, 6, 10, 1, 4, 10, 20, 35, 1, 5, 15, 35, 70, 126, 1, 6, 21, 56, 126, 252, 462, 1, 7, 28, 84, 210, 462, 924, 1716, 1, 8, 36, 120, 330, 792, 1716, 3432, 6427, 1, 9, 45, 165, 495, 1287, 3003, 6435, 12861, 24229, 1, 10, 55, 220, 715, 2002, 5005, 11440, 24300, 48520, 91828

Offset: 0

Vladimir Shevelev and Peter J. C. Moses, Jun 20 2012

For k <= 6, the triangle coincides with triangle A213745.

			Triangle begins
n/k |  0     1     2     3     4     5     6     7     8
----+---------------------------------------------------
  0 |  1
  1 |  1     1
  2 |  1     2     3
  3 |  1     3     6    10
  4 |  1     4    10    20    35
  5 |  1     5    15    35    70   126
  6 |  1     6    21    56   126   252   462
  7 |  1     7    28    84   210   462   924  1716
  8 |  1     8    36   120   330   792  1716  3432  6427

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

Cf. A007318, A005725, A059481, A111808, A187925, A213742, A213743, A213744, A000217, A000292, A000332, A000389, A000579, A000580.

Table[Sum[(-1)^r*Binomial[n, r]*Binomial[n - 8*r + k - 1, n - 1], {r, 0, Floor[k/8]}], {n, 0, 10}, {k, 0, n}] // Flatten (* G. C. Greubel, Nov 25 2017 *)

for(n=0,10, for(k=0,n, print1(if(n==0 && k==0, 1, sum(r=0, floor(k/8), (-1)^r*binomial(n,r)*binomial(n-8*r + k-1,n-1))), ", "))) \\ G. C. Greubel, Nov 25 2017

T(n,k) = Sum_{r=0..floor(k/8)} (-1)^r*C(n,r)*C(n-8*r+k-1, n-1).

T(n,0)=1, T(n,1)=n, T(n,2)=A000217(n) for n > 1, T(n,3)=A000292(n) for n >= 3, T(n,4)=A000332(n) for n >= 7, T(n,5)=A000389(n) for n >= 9, T(n,6)=A000579(n) for n >= 11, T(n,7)=A000580(n) for n >= 13.

A145171 Triangle read by rows: left half of trinomial triangle (A027907) modulo 3.

Original entry on oeis.org

1, 1, 1, 1, 2, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1

Offset: 1

Reikku Kulon, Oct 03 2008

Cf. A027907, A111808

cp's OEIS Frontend

A213744 Triangle of numbers C^(5)(n,k) of combinations with repetitions from n different elements over k for each of them not more than 5 appearances allowed.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A213745 Triangle of numbers C^(6)(n,k) of combinations with repetitions from n different elements over k for each of them not more than 6 appearances allowed.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A064054 Tenth column of trinomial coefficients.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A114929 Array read by antidiagonals: consider a semi-infinite chessboard with squares labeled (i,j), i >= 0, j >= 0; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).

Views

Author

Keywords

Examples

References

Crossrefs

Formula

Extensions

A114972 Array read by antidiagonals: consider a doubly infinite chessboard with squares labeled (i,j), i in Z, j in Z; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).

Views

Author

Keywords

Examples

References

Crossrefs

Formula

Extensions

A098470 Form array in which n-th row is obtained by expanding (1+x+x^2)^n and taking the 5th column from the center.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A178618 Triangle T(n,k) with the coefficient [x^k] of the series (1-x)^(n+1) * sum_{j=0..infinity} *binomial(n+3*j,3*j)*x^j, in row n, column k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

A213808 Triangle of numbers C^(7)(n,k) of combinations with repetitions from n different elements over k for each of them not more than 7 appearances allowed.

Views

Author

Keywords

Comments

Examples

Links

A178618 Triangle T(n,k) with the coefficient [x^k] of the series (1-x)^(n+1) * sum_{j=0..infinity} binomial(n+3j,3j)x^j, in row n, column k.