login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006621 Zarankiewicz's problem k_3(n,n+1).
(Formerly M4776)
6
11, 17, 23, 30, 38, 46, 55, 65, 75, 87 (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 3 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
R. K. Guy, A many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.
CROSSREFS
Cf. A001198 (k_3(n)), A006620 (k_2(n,n+1)), A006626 (k_4(n,n+1)).
Sequence in context: A275682 A265402 A145481 * A337359 A275596 A158913
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
a(10)-a(12) from Andrew Howroyd, Dec 26 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)