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.
%I A006620 M3775 #23 Mar 22 2024 18:02:30
%S A006620 5,8,11,15,19,23,27,32,37,43,49,54,59,64
%N 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.
%C A006620 a(n) <= A205805(2*n+1) + 1. - _Max Alekseyev_, Feb 02 2024
%D A006620 R. K. Guy, A many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.
%D A006620 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%Y A006620 Cf. A006613, A006614, A006615, A006616, A006617, A006618, A006619, A006621, A006622, A006623, A006624, A006625, A006626.
%Y A006620 Cf. A001197, A072567, A191965, A191873, A001198, A205805, A347473, A347474, A350304, A350237.
%K A006620 nonn,more
%O A006620 2,1
%A A006620 _N. J. A. Sloane_
%E A006620 Name changed at the suggestion of _Sean A. Irvine_ by _Max Alekseyev_, Feb 02 2024