cp's OEIS Frontend

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.

A006622 A variant of Zarankiewicz's problem: a(n) is the least k such that every n X (n+1) {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.

This page as a plain text file.
%I A006622 M4826 #22 Mar 22 2024 18:04:30
%S A006622 12,18,26,33,41,51
%N A006622 A variant of Zarankiewicz's problem: a(n) is the least k such that every n X (n+1) {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.
%D A006622 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006622 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 A006622 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.
%Y A006622 Cf. A006613, A006614, A006615, A006616, A006617, A006618, A006619, A006620, A006621, A006623, A006624, A006625, A006626.
%Y A006622 Cf. A001197, A072567, A191965, A191873, A001198, A205805, A347473, A347474, A350304, A350237.
%K A006622 nonn,more
%O A006622 3,1
%A A006622 _N. J. A. Sloane_
%E A006622 Name edited at the suggestion of _Sean A. Irvine_ and a(8) added by _Max Alekseyev_, Feb 02 2024