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 A355333 #9 Aug 22 2022 03:59:40
%S A355333 1,1,1,1,9,6,1,49,306,156,1,225,8550,40656,16104,1,961,194850,5771100,
%T A355333 21165720,6421800
%N A355333 Triangle read by rows: T(n,k) is the number of n X n Boolean matrices with Schein rank k, 0 <= k <= n.
%C A355333 Also, T(n,k) is the number of spanning subgraphs of the complete bipartite graph K_{n,n} that have bipartite dimension (or biclique covering number) k.
%H A355333 Mathematics Stack Exchange, <a href="https://math.stackexchange.com/questions/1345231/">Calculating the rank of a Boolean matrix and Boolean matrix factorization</a>
%H A355333 Wikipedia, <a href="https://en.wikipedia.org/wiki/Bipartite_dimension">Bipartite dimension</a>
%H A355333 Wikipedia, <a href="https://en.wikipedia.org/wiki/Boolean_matrix">Boolean matrix</a>
%e A355333 Triangle begins:
%e A355333 n\k | 0 1 2 3 4 5
%e A355333 ----+--------------------------------------
%e A355333 0 | 1
%e A355333 1 | 1 1
%e A355333 2 | 1 9 6
%e A355333 3 | 1 49 306 156
%e A355333 4 | 1 225 8550 40656 16104
%e A355333 5 | 1 961 194850 5771100 21165720 6421800
%Y A355333 Cf. A002416 (row sums), A064230, A286331, A354741, A355334.
%K A355333 nonn,tabl,more
%O A355333 0,5
%A A355333 _Pontus von Brömssen_, Jun 29 2022