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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006615 Zarankiewicz's problem.
(Formerly M4960)
0
15, 22, 31, 38, 46 (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 3 X 4 submatrix. - Sean A. Irvine, May 17 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..8.

CROSSREFS

Sequence in context: A076379 A227095 A038753 * A114867 A109288 A018889

Adjacent sequences:  A006612 A006613 A006614 * A006616 A006617 A006618

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 20 08:05 EDT 2019. Contains 328252 sequences. (Running on oeis4.)