login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006614 Zarankiewicz's problem.
(Formerly M4925)
0
14, 21, 26, 32, 41, 48, 56, 67 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,1

COMMENTS

a(n) is the least k such that every n X n {0,1}-matrix with k ones contains an all ones 2 X 4 submatrix. - Sean A. Irvine, May 17 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=4..11.

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: A096017 A274226 A324073 * A039832 A108633 A110478

Adjacent sequences:  A006611 A006612 A006613 * A006615 A006616 A006617

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 March 1 03:32 EST 2021. Contains 341732 sequences. (Running on oeis4.)