%I A139622
%S A139622 1,1,1,1,2,1,1,6
%N A139622 Table read by rows: T(n,k) is the number of strongly connected directed 
               multigraphs with loops and no vertex of degree 0,with n arcs and 
               k vertices.
%C A139622 T(n,1) = T(n,n) = 1, T(n,2) = T139621(n,2) - n(n+1)/2.
%C A139622 Row sums: A139627.
%Y A139622 Cf. A136564, A139621.
%Y A139622 Sequence in context: A098315 A036563 A025264 this_sequence A152656 A096162 
               A053383
%Y A139622 Adjacent sequences: A139619 A139620 A139621 this_sequence A139623 A139624 
               A139625
%K A139622 nonn,tabl
%O A139622 1,5
%A A139622 Benoit Jubin (benoit_jubin(AT)yahoo.fr), May 01 2008