We develop and apply combinatorial algorithms for investigation of the feasible distance distributions of binary orthogonal arrays with respect to a point of the ambient binary Hamming space utilizing constraints imposed from the relations between the distance distributions of connected arrays. This turns out to be strong enough and we prove the nonexistence of binary orthogonal arrays of parameters (length, cardinality, strength), , , , and , resolving the first cases where the existence was undecided so far. For the existing arrays our approach allows substantial reduction of the number of feasible distance distributions which could be helpful for classification results (uniqueness, for example).
