This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A006613 M4484 #15 Dec 26 2021 21:51:21
%S A006613 8,13,17,22,29,34,40,47,56
%N A006613 Zarankiewicz's problem.
%C A006613 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 A006613 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006613 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 A006613 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 A006613 nonn,more
%O A006613 3,1
%A A006613 _N. J. A. Sloane_