12310294

Appears in sequences

• T(n,k) = number of n X k matrices containing a permutation of 1..n*k in increasing order rowwise, columnwise, diagonally and (downwards) antidiagonally.at n=57A181196
• Number of 3 X n matrices containing a permutation of 1..3*n in increasing order rowwise, columnwise and (downwards) antidiagonally.at n=8A181197
• Number of permutations of 0..floor((3*n-2)/2) on odd squares of an 3Xn array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=16A215871
• Number of lattice paths from {n}^7 to {0}^7 using steps that decrement one component such that for each point (p_1,p_2,...,p_7) we have p_1<=p_2<=...<=p_7.at n=3A227598