login
A006613
Zarankiewicz's problem.
(Formerly M4484)
10
8, 13, 17, 22, 29, 34, 40, 47, 56
OFFSET
3,1
COMMENTS
a(n) is the least k such that every n X n {0,1}-matrix with k ones contains an all ones 2 X 3 submatrix. - Sean A. Irvine, May 16 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: A070112 A070113 A178968 * A204221 A348277 A337308
KEYWORD
nonn,more
STATUS
approved