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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006620 A variant of Zarankiewicz's problem: 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 2 submatrix.
(Formerly M3775)
6
5, 8, 11, 15, 19, 23, 27, 32, 37, 43, 49, 54, 59, 64 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
a(n) <= A205805(2*n+1) + 1. - Max Alekseyev, Feb 02 2024
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
CROSSREFS
Sequence in context: A363889 A118520 A001954 * A176628 A314390 A314391
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
Name changed at the suggestion of Sean A. Irvine by Max Alekseyev, Feb 02 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 08:21 EDT 2024. Contains 371698 sequences. (Running on oeis4.)