302615

Appears in sequences

• T(n,0) + T(n,1) + ... + T(n,n), T given by A027907.at n=12A027914
• Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=a(n-1,n-1), a(n,k)=a(n,k-1) + Sum_{i=0..k-1} a(n-1,i).at n=27A108041
• Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=a(n-1,n-1), a(n,k)=a(n,k-1) + Sum_{i=0..k-1} a(n-1,i).at n=28A108041
• Leading diagonal of triangle A108041.at n=7A108042
• Number of 0..2 arrays of length n+11 with sum no more than 12 in any length 12 subsequence (=50% duty cycle).at n=0A212230
• T(n,k)=Number of 0..2 arrays of length n+2*k-1 with sum no more than 2*k in any length 2k subsequence (=50% duty cycle).at n=15A212232
• Number of 0..2 arrays of length 2*n with sum no more than 2*n in any length 2n subsequence (=50% duty cycle).at n=5A212233
• Number of n X 2 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=17A240359