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 A355335 #5 Jul 02 2022 14:37:04 %S A355335 1,0,1,0,1,1,0,2,4,0,0,2,13,6,0,0,3,38,67,4,0,0,3,94,550,205,1,0,0,4, %T A355335 214,3996,6543,360,0,0,0,4,441,25037,176012,59266,320,0,0 %N A355335 Triangle read by rows: T(n,k) is the number of unlabeled connected graphs with n nodes and bipartite dimension (or biclique covering number) k, 0 <= k < n. %H A355335 Wikipedia, <a href="https://en.wikipedia.org/wiki/Bipartite_dimension">Bipartite dimension</a> %F A355335 T(n,1) = floor(n/2) = A004526(n). %e A355335 Triangle begins: %e A355335 n\k | 0 1 2 3 4 5 6 7 8 %e A355335 ----+-------------------------------------- %e A355335 1 | 1 %e A355335 2 | 0 1 %e A355335 3 | 0 1 1 %e A355335 4 | 0 2 4 0 %e A355335 5 | 0 2 13 6 0 %e A355335 6 | 0 3 38 67 4 0 %e A355335 7 | 0 3 94 550 205 1 0 %e A355335 8 | 0 4 214 3996 6543 360 0 0 %e A355335 9 | 0 4 441 25037 176012 59266 320 0 0 %Y A355335 Cf. A001349 (row sums), A004526 (column k=1), A355334, A355336. %K A355335 nonn,tabl,more %O A355335 1,8 %A A355335 _Pontus von Brömssen_, Jun 29 2022