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 A006614 M4925 #28 Nov 05 2024 12:13:15
%S A006614 14,21,26,32,41,48,56,67
%N A006614 A variant of Zarankiewicz's problem: a(n) is the least k such that every n X n {0,1}-matrix with k ones contains an all-ones 2 X 4 submatrix.
%D A006614 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006614 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 A006614 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.
%H A006614 Dmitry I. Ignatov, <a href="https://fca4ai.hse.ru/mirror/pubs/share/direct/974862483.pdf#page=27">When contranominal scales give a solution to the Zarankiewicz problem?</a>, Workshop Notes, 12th Int'l Wksp. Formal Concept Analysis Artif. Intel. (FCA4AI 2024), 27-38. See p. 35.
%Y A006614 Cf. A006613, A006615, A006616, A006617, A006618, A006619, A006620, A006621, A006622, A006623, A006624, A006625, A006626.
%Y A006614 Cf. A001197, A072567, A191965, A191873, A001198, A205805, A347473, A347474, A350304, A350237.
%K A006614 nonn,more
%O A006614 4,1
%A A006614 _N. J. A. Sloane_
%E A006614 Name updated at the suggestion of _Sean A. Irvine_ by _Max Alekseyev_, Feb 02 2024