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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006623 Zarankiewicz's problem.
(Formerly M4681)
0
10, 15, 20, 25, 32, 37, 43, 51 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,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 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=4..11.

CROSSREFS

Sequence in context: A004259 A210652 A284804 * A035166 A129495 A101258

Adjacent sequences:  A006620 A006621 A006622 * A006624 A006625 A006626

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 22 09:52 EST 2019. Contains 319363 sequences. (Running on oeis4.)