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 A006618 M4775 #17 Dec 26 2021 21:51:34
%S A006618 11,17,22,28,36,43,51,61
%N A006618 Zarankiewicz's problem.
%C A006618 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 4 submatrix. - _Sean A. Irvine_, May 18 2017
%D A006618 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006618 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 A006618 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 A006618 nonn,more
%O A006618 3,1
%A A006618 _N. J. A. Sloane_