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!)
A006618 Zarankiewicz's problem.
(Formerly M4775)
0
11, 17, 22, 28, 36, 43, 51, 61 (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 2 X 4 submatrix. - Sean A. Irvine, May 18 2017

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=3..10.

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

Sequence in context: A322476 A176603 A050715 * A184551 A190039 A066074

Adjacent sequences:  A006615 A006616 A006617 * A006619 A006620 A006621

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 19 20:16 EST 2019. Contains 319310 sequences. (Running on oeis4.)