|
|
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.
|
|
2
|
|
|
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, 214, 3996, 6543, 360, 0, 0, 0, 4, 441, 25037, 176012, 59266, 320, 0, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Triangle begins:
n\k | 0 1 2 3 4 5 6 7 8
----+--------------------------------------
1 | 1
2 | 0 1
3 | 0 1 1
4 | 0 2 4 0
5 | 0 2 13 6 0
6 | 0 3 38 67 4 0
7 | 0 3 94 550 205 1 0
8 | 0 4 214 3996 6543 360 0 0
9 | 0 4 441 25037 176012 59266 320 0 0
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|