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

15, 22, 31, 38, 46, 57

Offset

4,1

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..9.

Crossrefs

Cf. A006613, A006614, A006616, A006617, A006618, A006619, A006620, A006621, A006622, A006623, A006624, A006625, A006626.

Cf. A001197, A072567, A191965, A191873, A001198, A205805, A347473, A347474, A350304, A350237.

Sequence in context: A076379 A227095 A038753 * A114867 A109288 A018889

Adjacent sequences: A006612 A006613 A006614 * A006616 A006617 A006618

Keyword

nonn,more

Author

N. J. A. Sloane

Extensions

Name changed at the suggestion of Sean A. Irvine and a(9) added by Max Alekseyev, Feb 02 2024

Status

approved