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 A006623 M4681 #19 Jul 08 2025 16:50:51
%S A006623 10,15,20,25,32,37,43,51
%N A006623 Zarankiewicz's problem.
%C A006623 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 3 submatrix. - _Sean A. Irvine_, May 18 2017
%D A006623 R. K. Guy, A many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.
%D A006623 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%K A006623 nonn,more
%O A006623 4,1
%A A006623 _N. J. A. Sloane_