|
|
A139624
|
|
Table read by rows: T(n,k) is the number of connected directed multigraphs with loops and no vertex of degree 0, with n arcs and k vertices, which are transitive (the existence of a path between two points implies the existence of an arc between those two points).
|
|
4
|
|
|
1, 1, 1, 3, 2, 1, 6, 7, 3, 1, 11
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Length of the n-th row: n+1.
T(n,1) = 1
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins
1;
1, 1;
3, 2, 1;
6, 7, 3, 1;
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|