|
Search: id:A005991
|
|
|
| A005991 |
|
Let k(n) denote the least integer such that every n X n (0,1)-matrix with exactly k(n) ones in each row and in each column contains a 2 X 2 submatrix without zeros. The sequence gives the index n of the last term in each string of equal entries in k(n). (Formerly M1582)
|
|
+0 1
|
| |
|
|
Search completed in 0.002 seconds
|