cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A001197 Zarankiewicz's problem k_2(n).

Original entry on oeis.org

4, 7, 10, 13, 17, 22, 25, 30, 35, 40, 46, 53, 57, 62, 68, 75, 82, 89, 97, 106, 109, 116, 123
Offset: 2

Views

Author

Keywords

Comments

a(n) is the minimum number k_2(n) such that any n X n matrix having that number of nonzero entries has a 2 X 2 submatrix with only nonzero entries. - M. F. Hasler, Sep 28 2021
a(n) <= (1 + sqrt(4*n-3))*n/2 + 1. - Max Alekseyev, Apr 03 2022

References

  • L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 291.
  • R. K. Guy, A problem of Zarankiewicz, in P. ErdÅ‘s and G. Katona, editors, Theory of Graphs (Proceedings of the Colloquium, Tihany, Hungary), Academic Press, NY, 1968, pp. 119-150.
  • Richard J. Nowakowski, Zarankiewicz's Problem, PhD Dissertation, University of Calgary, 1978, page 202.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Cf. also A006613 - A006626 (other sizes, in particular A006616 = k_4).
Main diagonal of A376167.

Formula

a(n) = A072567(n) + 1. - Rob Pratt, Aug 09 2019
a(n) = n^2 - A347472(n) = n^2 - A350296(n) + 1. - Andrew Howroyd, Dec 26 2021

Extensions

Nowakowski's thesis, directed by Guy, corrected Guy's value for a(15) and supplied a(16)-a(21) entered by Don Knuth, Aug 13 2014
a(1) deleted following a suggestion from M. F. Hasler. - N. J. A. Sloane, Oct 22 2021
a(22)-a(24) from Jeremy Tan, Jan 23 2022
Showing 1-1 of 1 results.