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!)
A006621 Zarankiewicz's problem.
(Formerly M4776)
0
11, 17, 23, 30, 38, 46, 55 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,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 3 X 3 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=3..9.

CROSSREFS

Sequence in context: A275682 A265402 A145481 * A275596 A158913 A066938

Adjacent sequences:  A006618 A006619 A006620 * A006622 A006623 A006624

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 15 23:42 EST 2019. Contains 319184 sequences. (Running on oeis4.)