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).

1, 1, 1, 3, 2, 1, 6, 7, 3, 1, 11

Offset: 1

Author

Benoit Jubin, May 01 2008

Keywords

• nonn
• tabl
• more

Comments

Length of the n-th row: n+1.

T(n,1) = 1

Row sums: A139629.

Examples

			Triangle begins
1;
1, 1;
3, 2, 1;
6, 7, 3, 1;
		

Crossrefs

Cf. A139623, A139625.