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