131473

Appears in sequences

• T(n,3,1), where T(n,k,s) with 0<=s<n is the number of sequences a_1,...,a_(k*n+s) of integers 0,1,...,n such that the 'bumped' sequence b_1,...,b_(k*n+s) has exactly s n's, where b_i=a_i + j (mod n+1) with minimal j>=0 such that b_0,...,b_i contain at most k elements equal to b_i.at n=3A006700
• Number of (n+1) X (3+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=17A258549