Hello everyone,
Let k(m) denote the least integer such that every m X m (0,1)-matrix with exactly k(m) ones in each row and in each column contains a 2 X 2 submatrix without zeros. The sequence gives the index n of the first term in each string of equal entries in the {k(m)} sequence (see A155934).
The sequence reads k(2)-k(7) the least integer is {2, 3, 7, 13, 21, 31}. However the confusion I am having to what this sequence actually means starts at k(4) = 7. How can a 4 X 4 (0,1)-matrix have exactly 7 ones in each row and 7 ones in each column? There are just not enough rows and columns. Does this actually mean that the whole matrix actually only has 7 ones maybe, but if it does why not just say that?
The same confusion also applies to the sequence
https://oeis.org/A005991 too, which effectively has the exact same NAME/definition.
--------------------------------------------------
--------------------------------------------------
Let k(m) denote the least integer such that every m X m (0,1)-matrix with exactly k(m) ones in each row and in each column contains a 2 X 2 submatrix without zeros.
And that
https://oeis.org/A005991 should just be:
The sequence gives the index n of the last term in each string of equal entries in the {k(m)} sequence (see A155934).
The sequence gives the index n of the first term in each string of equal entries in the {k(m)} sequence (see A155934).
If this interpretation is correct, the three pages could perhaps be made clearer by adjusting their NAME or COMMENTS sections accordingly.
Could someone please confirm whether this reading is indeed what was intended?