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.

A006624 a(n) is the least k such that every n X (n+3) {0,1}-matrix with k ones contains an all-ones 2 X 4 submatrix.

This page as a plain text file.
%I A006624 M4600 #24 Feb 04 2024 18:43:31
%S A006624 9,14,20,27,33,41,49,57
%N A006624 a(n) is the least k such that every n X (n+3) {0,1}-matrix with k ones contains an all-ones 2 X 4 submatrix.
%D A006624 R. K. Guy, A many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.
%D A006624 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%K A006624 nonn,more
%O A006624 2,1
%A A006624 _N. J. A. Sloane_
%E A006624 Replaced definition with more precise version from a comment of _Sean A. Irvine_ from May 18 2017. - _N. J. A. Sloane_, Feb 04 2024