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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006622 Zarankiewicz's problem.
(Formerly M4826)
0
12, 18, 26, 33, 41 (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 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..7.

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: A325387 A272860 A071354 * A124269 A179192 A112054

Adjacent sequences:  A006619 A006620 A006621 * A006623 A006624 A006625

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 October 15 22:25 EDT 2019. Contains 328038 sequences. (Running on oeis4.)