|
| |
|
|
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; graph; refs; listen; history; internal format)
|
| |
| |
|
|
