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.

A006613 Zarankiewicz's problem.

Original entry on oeis.org

8, 13, 17, 22, 29, 34, 40, 47, 56
Offset: 3

Views

Author

Keywords

Comments

a(n) is the least k such that every n X n {0,1}-matrix with k ones contains an all ones 2 X 3 submatrix. - Sean A. Irvine, May 16 2017

References

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