login
The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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)
4
15, 22, 31, 38, 46, 57
(list; graph; refs; listen; history; text; internal format)
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

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified December 12 17:18 EST 2024. Contains 378666 sequences.
License Agreements, Terms of Use, Privacy Policy