Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I M4484 #15 Dec 26 2021 21:51:21
%S 8,13,17,22,29,34,40,47,56
%N Zarankiewicz's problem.
%C a(n) is the least k such that every n X n {0,1}-matrix with k ones contains an all ones 2 X 3 submatrix. - _Sean A. Irvine_, May 16 2017
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H R. K. Guy, <a href="/A001197/a001197.pdf">A problem of Zarankiewicz</a>, Research Paper No. 12, Dept. of Math., Univ. Calgary, Jan. 1967. [Annotated and scanned copy, with permission]
%H R. K. Guy, <a href="http://dx.doi.org/10.1007/BFb0060112">A many-facetted problem of Zarankiewicz</a>, Lect. Notes Math. 110 (1969), 129-148.
%K nonn,more
%O 3,1
%A _N. J. A. Sloane_