%I M3775
%S 5,8,11,15,19,23,27,32,37,43,49,54,59,64
%N Zarankiewicz's problem.
%C a(n) is the least k such that every n X (n+1) {0,1}matrix with k ones contains an all ones 2 X 2 submatrix.  _Sean A. Irvine_, May 18 2017
%D R. K. Guy, A manyfacetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129148.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%K nonn,more
%O 2,1
%A _N. J. A. Sloane_.
