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

%I M4776 #20 Dec 26 2021 18:26:33

%S 11,17,23,30,38,46,55,65,75,87

%N Zarankiewicz's problem k_3(n,n+1).

%C 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

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H R. K. Guy, <a href="http://dx.doi.org/10.1007/BFb0060112">A many-facetted problem of Zarankiewicz</a>, Lect. Notes Math. 110 (1969), 129-148.

%Y Cf. A001198 (k_3(n)), A006620 (k_2(n,n+1)), A006626 (k_4(n,n+1)).

%K nonn,more

%O 3,1

%A _N. J. A. Sloane_

%E a(10)-a(12) from _Andrew Howroyd_, Dec 26 2021

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 April 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)