%I A139624
%S A139624 1,1,1,3,2,1,6,7,3,1,11
%N 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).
%C A139624 Length of the n^th row: n+1.
%C A139624 T(n,1) = 1
%C A139624 Row sums: A139629.
%Y A139624 Cf. A139623, A139625.
%Y A139624 Sequence in context: A113655 A114155 A079513 this_sequence A132276 A114586 
               A052174
%Y A139624 Adjacent sequences: A139621 A139622 A139623 this_sequence A139625 A139626 
               A139627
%K A139624 nonn
%O A139624 1,4
%A A139624 Benoit Jubin (benoit_jubin(AT)yahoo.fr), May 01 2008