A variant of Zarankiewicz problem: maximal number of 1s in n X n 01-matrix with no four 1s forming a rectangle.

A072567

A variant of Zarankiewicz problem: maximal number of 1s in n X n 01-matrix with no four 1s forming a rectangle.

Terms

    a(0) =1a(1) =3a(2) =6a(3) =9a(4) =12a(5) =16a(6) =21a(7) =24a(8) =29a(9) =34a(10) =39a(11) =45a(12) =52a(13) =56a(14) =61a(15) =67a(16) =74a(17) =81a(18) =88a(19) =96a(20) =105a(21) =108a(22) =115a(23) =122

External references