A006623 Zarankiewicz's problem. (Formerly M4681)

10, 15, 20, 25, 32, 37, 43, 51

Offset

4,1

Comments

a(n) is the least k such that every n X (n-1) {0,1}-matrix with k ones contains an all ones 2 X 3 submatrix. - Sean A. Irvine, May 18 2017

References

R. K. Guy, A many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Table of n, a(n) for n=4..11.

Crossrefs

Sequence in context: A004259 A210652 A284804 * A035166 A129495 A101258

Adjacent sequences: A006620 A006621 A006622 * A006624 A006625 A006626

Keyword

nonn,more

Author

N. J. A. Sloane.

Status

approved