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.

A006620 A variant of Zarankiewicz's problem: a(n) is the least k such that every n X (n+1) {0,1}-matrix with k ones contains an all-ones 2 X 2 submatrix.

Table of values

n a(n)
2 5
3 8
4 11
5 15
6 19
7 23
8 27
9 32
10 37
11 43
12 49
13 54
14 59
15 64

List of values

[5, 8, 11, 15, 19, 23, 27, 32, 37, 43, 49, 54, 59, 64]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.