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.

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

Original entry on oeis.org

11, 17, 23, 30, 38, 46, 55, 65, 75, 87
Offset: 3

Views

Author

Keywords

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).

Crossrefs

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

Extensions

a(10)-a(12) from Andrew Howroyd, Dec 26 2021