2625117

Appears in sequences

• Number of distinct n X n (0,1) matrices after double sorting: by row, by column, by row .. until reaching a fixed point.at n=6A089006
• Number of n X n binary arrays with rows and columns, considered as binary numbers, in nondecreasing order, and all but the outermost 3 rows or columns zero.at n=0A162026
• Number of n X n binary arrays with rows and columns, considered as binary numbers, in nondecreasing order, and no more than 6 ones in any row or column.at n=5A162048
• Number of n X n binary arrays with rows and columns, considered as binary numbers, in nondecreasing order, and no more than 7 ones in any row or column.at n=5A162049
• Number of n X n binary arrays with rows and columns, considered as binary numbers, in nondecreasing order, and no more than 8 ones in any row or column.at n=5A162050
• Number of n X n binary arrays with rows and columns, considered as binary numbers, in nondecreasing order, and no more than 9 ones in any row or column.at n=5A162051
• Number of nX6 binary arrays with rows and columns in nondecreasing order.at n=5A184141
• T(n,k)=Number of n X n 0..k arrays with rows and columns in lexicographically nondecreasing order.at n=20A229794
• Number of 6X6 0..n arrays with rows and columns in lexicographically nondecreasing order.at n=0A229799
• Number of (n+1)X(n+1) 0..1 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..n+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=4A232789
• Number of (n+1)X(5+1) 0..1 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..5+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=4A232794
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=40A232797
• T(n,k) is the number of distinct n X n {0,1}-matrices that reach a fixed point after k alternately applied sorts by rows and columns, where T(n,k), k>=0 is an irregular triangle read by rows.at n=22A374525
• Similar to A374525, but for each starting matrix with a choice of whether to sort by columns or rows first, such that the total number of sorting steps for this matrix is minimized.at n=22A374526