Enumeration of binary orthogonal arrays of strength 1 (Q5946760)

A binary \((2k,n)\)-matrix is an orthogonal array of strength \(1\) if each column is balanced (\(4k\) entries \(1,\) \(k\) entries \(0\)). It is simple of no two rows are the same. Counting all orthogonal arrays of strength \(1\) is trivial. In this paper the principle of inclusion and exclusion is used to obtain an ugly formula for the number of all simple binary orthogonal arrays of strength \(1.\) The cases of \(4\) rows and \(6\) rows are worked out completely.