The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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). 4

%I #5 Mar 30 2012 18:57:03

%S 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,

%T 1,16,54,98,98,54,16,1,1,18,70,152,197,152,70,18,1,1,20,88,222,350,

%U 350,222,88,20,1,1,22,108,310,572,701,572,310,108

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

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

%K nonn,tabl

%O 0,5

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 2 07:56 EDT 2023. Contains 365831 sequences. (Running on oeis4.)