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).

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).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =5a(5) =1a(6) =1a(7) =8a(8) =8a(9) =1a(10) =1a(11) =10a(12) =17a(13) =10a(14) =1a(15) =1a(16) =12a(17) =28a(18) =28a(19) =12a(20) =1a(21) =1a(22) =14a(23) =40a(24) =57a(25) =40a(26) =14a(27) =1a(28) =1a(29) =16

External references