A054110 Triangular array T(n,k): in Pascal's triangle, draw vertical lines through binomial(n-1,k-1) (if present) and binomial(n-1,k) (if present); then T(n,k) is the sum of binomial(i,j) that lie on or between the lines and not below binomial(n,k).

1, 1, 1, 1, 5, 1, 1, 8, 8, 1, 1, 10, 17, 10, 1, 1, 12, 28, 28, 12, 1, 1, 14, 40, 57, 40, 14, 1, 1, 16, 54, 98, 98, 54, 16, 1, 1, 18, 70, 152, 197, 152, 70, 18, 1, 1, 20, 88, 222, 350, 350, 222, 88, 20, 1, 1, 22, 108, 310, 572, 701, 572, 310, 108

Offset: 0

Author

Clark Kimberling

Keywords

• nonn
• tabl

Examples

			Rows: {1}, {1,1}, {1,5,1}, {1,8,8,1}, ...