A006614 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 2 X 4 submatrix. (Formerly M4925)

14, 21, 26, 32, 41, 48, 56, 67

Offset

4,1

References

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.

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

Cf. A006613, A006615, 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: A096017 A274226 A324073 * A039832 A108633 A110478

Adjacent sequences: A006611 A006612 A006613 * A006615 A006616 A006617

Keyword

nonn,more

Author

N. J. A. Sloane

Extensions

Name updated at the suggestion of Sean A. Irvine by Max Alekseyev, Feb 02 2024

Status

approved