A133158 -id:A133158 - cp's OEIS frontend

A124575 Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (2,4,4,...) and super- and subdiagonals (1,1,1,...).

1, 2, 1, 5, 6, 1, 16, 30, 10, 1, 62, 146, 71, 14, 1, 270, 717, 444, 128, 18, 1, 1257, 3582, 2621, 974, 201, 22, 1, 6096, 18206, 15040, 6718, 1800, 290, 26, 1, 30398, 93960, 85084, 43712, 14208, 2986, 395, 30, 1, 154756, 491322, 478008, 274140, 103530

Offset: 0

Gary W. Adamson & Roger L. Bagula, Nov 05 2006

Column k=0 yields A033543 (2nd binomial transform of the sequence A000957(n+1)). Row sums yield A133158. [Corrected by Philippe Deléham, Oct 24 2007, Dec 05 2009]
Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 2*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + 4*T(n-1,k) + T(n-1,k+1) for k >= 1. - Philippe Deléham, Mar 27 2007
This triangle belongs to the family of triangles defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = x*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1)  +y*T(n-1,k) + T(n-1,k+1) for k >= 1. Other triangles arise from choosing different values for (x,y): (0,0) -> A053121; (0,1) -> A089942; (0,2) -> A126093; (0,3) -> A126970; (1,0)-> A061554; (1,1) -> A064189; (1,2) -> A039599; (1,3) -> A110877; (1,4) -> A124576; (2,0) -> A126075; (2,1) -> A038622; (2,2) -> A039598; (2,3) -> A124733; (2,4) -> A124575; (3,0) -> A126953; (3,1) -> A126954; (3,2) -> A111418; (3,3) -> A091965; (3,4) -> A124574; (4,3) -> A126791; (4,4) -> A052179; (4,5) -> A126331; (5,5) -> A125906. - Philippe Deléham, Sep 25 2007

			Row 2 is (5,6,1) because M[3]= [2,1,0;1,4,1;0,1,4] and M[3]^2=[5,6,1;6,18,8;1,8,17].
Triangle starts:
    1;
    2,   1;
    5,   6,   1;
   16,  30,  10,   1;
   62, 146,  71,  14,  1;
  270, 717, 444, 128, 18, 1;

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

Cf. A124576, A124574, A052179, A064613, A133158.

with(linalg): m:=proc(i,j) if i=1 and j=1 then 2 elif i=j then 4 elif abs(i-j)=1 then 1 else 0 fi end: for n from 3 to 11 do A[n]:=matrix(n,n,m): B[n]:=multiply(seq(A[n],i=1..n-1)) od: 1; 2,1; for n from 3 to 11 do seq(B[n][1,j],j=1..n) od; # yields sequence in triangular form

M[n_] := SparseArray[{{1, 1} -> 2, Band[{2, 2}] -> 4, Band[{1, 2}] -> 1, Band[{2, 1}] -> 1}, {n, n}]; row[1] = {1}; row[n_] := MatrixPower[M[n], n-1] // First // Normal; Table[row[n], {n, 1, 10}] // Flatten (* Jean-François Alcover, Jan 09 2014 *)

T(n,k) = T(n-1,k-1) + 4*T(n-1,k) + T(n-1,k-1) for k >= 2.
Sum_{k=0..n} T(n,k)*(3*k+1) = 6^n. - Philippe Deléham, Mar 27 2007
Sum_{k>=0} T(m,k)*T(n,k) = T(m+n,0) = A033543(m+n). - Philippe Deléham, Nov 22 2009

Edited by N. J. A. Sloane, Dec 04 2006

A171650 Triangle T, read by rows : T(n,k) = A007318(n,k)*A026641(n-k).

Original entry on oeis.org

1, 1, 1, 4, 2, 1, 13, 12, 3, 1, 46, 52, 24, 4, 1, 166, 230, 130, 40, 5, 1, 610, 996, 690, 260, 60, 6, 1, 2269, 4270, 3486, 1610, 455, 84, 7, 1, 8518, 18152, 17080, 9296, 3220, 728, 112, 8, 1, 32206, 76662, 81684, 51240, 20916, 5796, 1092, 144, 9, 1

Offset: 0

Philippe Deléham, Dec 13 2009

			Triangle begins as
    1;
    1,   1;
    4,   2,   1;
   13,  12,   3,  1;
   46,  52,  24,  4, 1;
  166, 230, 130, 40, 5, 1; ...

G. C. Greubel, Rows n = 0..100 of triangle, flattened

[[(-1)^(n-k)*Binomial(n,k)*(&+[(-1)^j*Binomial(n-k+j,j): j in [0..n-k]]): k in [0..n]]: n in [0..10]]; // G. C. Greubel, Apr 29 2019

T[n_, k_]:= (-1)^(n-k)*Binomial[n, k]*Sum[(-1)^j*Binomial[n-k+j, j], {j, 0, n-k}]; Table[T[n, k], {n, 0, 10}, {k, 0, n}]//Flatten (* G. C. Greubel, Apr 29 2019 *)

{T(n,k) = (-1)^(n-k)*binomial(n,k)*sum(j=0,n-k,(-1)^j*binomial(n-k+j,j))}; \\ G. C. Greubel, Apr 29 2019

[[(-1)^(n-k)*binomial(n,k)*sum((-1)^j*binomial(n-k+j,j) for j in (0..n-k)) for k in (0..n)] for n in (0..10)] # G. C. Greubel, Apr 29 2019

Sum_{k, 0<=k<=n} T(n,k)*x^k = A127361(n), A127328(n), A026641(n), A126568(n), A133158(n) for x = -2, -1, 0, 1, 2 respectively.

T(n, k) = (-1)^(n-k)*binomial(n, k)*Sum_{j=0..n-k} (-1)^j*Binomial(n-k+j, j). - G. C. Greubel, Apr 29 2019

A171150 Triangle related to T(x,2x).

Original entry on oeis.org

1, 1, 1, 2, 3, 1, 3, 9, 7, 1, 6, 20, 28, 15, 1, 10, 50, 85, 75, 31, 1, 20, 105, 255, 294, 186, 63, 1, 35, 245, 651, 1029, 903, 441, 127, 1, 70, 504, 1736, 3108, 3612, 2568, 1016, 255, 1, 126, 1134, 4116, 9324, 12636, 11556, 6921, 2295, 511, 1, 252, 2310, 10290, 25080, 42120, 46035, 34605, 17930, 5110, 1023, 1

Offset: 0

Philippe Deléham, Dec 04 2009

Let the triangle T_(x,y)=T defined by T(0,0)=1, T(n,k)=0 if k<0 or if k>n, T(n,0)=x*T(n-1,0)+T(n-1,1), T(n,k)=T(n-1,k-1)+y*T(n-1,k)+T(n-1,k+1) for k>=1.
This triangle gives the coefficients of Sum_{k=0..n} T(n,k) where y=2x.
T_(0,0) = A053121, T_(1,2) = A039599, T_(2,4) = A124575.
First column of T_(x,2x) is given by A126222.

			Triangle begins:
   1;
   1,  1;
   2,  3,  1;
   3,  9,  7,  1;
   6, 20, 28, 15,  1;
  10, 50, 85, 75, 31,  1;
  ...

M. Barnabei, F. Bonetti, and M. Silimbani, The Eulerian numbers on restricted centrosymmetric permutations, PU. M. A. Vol. 21 (2010), No. 2, pp. 99-118 (see Table p. 118, with additional zeros); see also, arXiv:0910.2376 [math.CO], 2009.

Cf. A000012, A000225, A058877, A126222.

Row sums give A000984.

Sum_{k=0..n} T(n,k)*x^k = A000007(n), A001405(n), A000984(n), A133158(n) for x = -1, 0, 1, 2 respectively.

More terms from Alois P. Heinz, Jan 31 2023

cp's OEIS Frontend

A124575 Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (2,4,4,...) and super- and subdiagonals (1,1,1,...).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A171650 Triangle T, read by rows : T(n,k) = A007318(n,k)*A026641(n-k).

Views

Author

Keywords

Examples

Links

Programs

Magma

Mathematica

PARI

Sage

Formula

A171150 Triangle related to T(x,2x).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions