login
A006619
Zarankiewicz's problem.
(Formerly M4485)
5
8, 13, 18, 24, 31, 38, 46, 55
OFFSET
2,1
COMMENTS
a(n) is the least k such that every n X (n+2) {0,1}-matrix with k ones contains an all ones 2 X 4 submatrix. - Sean A. Irvine, May 18 2017
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
R. K. Guy, A problem of Zarankiewicz, Research Paper No. 12, Dept. of Math., Univ. Calgary, Jan. 1967. [Annotated and scanned copy, with permission]
R. K. Guy, A many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.
CROSSREFS
Sequence in context: A095097 A187227 A224251 * A023487 A045636 A214723
KEYWORD
nonn,more,changed
STATUS
approved