This site is supported by donations to The OEIS Foundation.
Triangles Row Sum CentralBinomial
This is the latest A008459 Square the entries of Pascal's triangle.
A027555 Triangle of binomial coefficients C(-n,k).
A039599 Triangle formed from even-numbered columns of triangle of expansions of powers of x in terms of Chebyshev polynomials U_n(x).
A050165 Triangle read by rows: T(n,k)=M(2n+1,k,-1), 0<=k<=n, n >= 0, array M as in A050144.
A059481 Triangle T(n,k) = binomial(n+k-1,k), 0 <= k <= n, read by rows.
A097692 Triangle read by rows: a(n,k) = number of paths of n upsteps U and n downsteps D that contain k UDUs.
A100100 Triangle T(n,k) = binomial(2*n-k-1, n-k) read by rows.
A108747 Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n and having k returns to the x-axis. (A Grand Dyck path of semilength n is a path in the half-plane x>=0, starting at (0,0), ending at (2n,0) and consisting of steps u=(1,1) and d=(1,-1)).
A118920 Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that cross the x-axis k times (n>=1, k>=0).
A118921 Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n having first return to the x-axis at (2k,0) (n,k>=1). (A Grand Dyck path of semilength n is a path in the half-plane x>=0, starting at (0,0), ending at (2n,0) and consisting of steps u=(1,1) and d=(1,-1)).
A118963 Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that have k double rises (n>=1,k>=0).
A118964 Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that have k double rises above the x-axis (n>=1,k>=0). (A Grand Dyck path of semilength n is a path in the half-plane x>=0, starting at (0,0), ending at (2n,0) and consisting of steps u=(1,1) and d=(1,-1); a double rise in a Grand Dyck path is an occurrence of uu in the path.)
A135091 A007318 * triangle M, where M = A002426 * 0^(n-k), 0<=k<=n.
A152229 Eigentriangle, row sums = A000984
A155788 Renewal array for 1/(x+sqrt(1-4x)).
A158815 Triangle T(n,k) read by rows, matrix product of A046899(row-reversed) * A130595.
A168256 Triangle read by rows: Catalan number C(n) repeated n+1 times.
A171128 A117852*A130595 as lower triangular matrices.
A171150 Triangle related to T(x,2x).
A171698 Square 'central binomial coefficients'-array read by anti-diagonals
A171824 Triangle T(n,k)= binomial(n + k,n) + binomial(2*n-k,n) read by rows.
A205946 Triangle read by rows related to A000984, central binomial coefficients
A212207 Triangle read by rows: coefficients of polynomials p_{n,n-1}(x) arising in enumeration of two-line arrays.
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.
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.
A227924 Triangle T(n,k): the number of binary sequences of n zeros and n ones in which the shortest run is of length k.
A229756 Triangle T(n,k): the number of binary sequences of n zeros and n ones in which the longest run is of length k.
A274293 Triangle read by rows: T(n,k) (0 <= k <= n) given by T(n,0) = 1, T(n,1) = 2^n - 1, T(n,2) = 2^n - 2, T(n,n-1) = T(n,n) = binomial(2n-2,n-1); and the other internal entries satisfy T(n,k) = T(n,k-1) + T(n-1,k).
