login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006620 Zarankiewicz's problem.
(Formerly M3775)
0
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) 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. - 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=2..15.

CROSSREFS

Sequence in context: A314389 A118520 A001954 * A176628 A314390 A314391

Adjacent sequences:  A006617 A006618 A006619 * A006621 A006622 A006623

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 06:41 EST 2019. Contains 319207 sequences. (Running on oeis4.)