%I A143842
%S A143842 1,1,0,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,2,1,0,1,1,1,1,2,3,1,
%T A143842 0,1,1,1,1,2,3,7,1,0,1,1,1,1,2,3,7,11,1,0,1,1,1,1,2,3,7,11,20,1,0,1,1,
               1,
%U A143842 1,2,3,7,11,20,29,1,0,1,1,1,1,2,3,7,11,20,30,45,1,0,1,1,1,1,2,3,7,11,20
%N A143842 Table read by antidiagonals: T(n,k) is the number of strongly connected 
               directed multigraphs with loops 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 A143842 Partial sums of the rows of A139625, i.e., T(n,k) = sum(T139625(n,p),
               p=0..k).
%C A143842 If k>=floor(sqrt(n)), T(n,k) = A139630(n).
%Y A143842 Cf. A138352, A136868, A143841.
%Y A143842 Sequence in context: A100544 A130654 A053259 this_sequence A092876 A024940 
               A054635
%Y A143842 Adjacent sequences: A143839 A143840 A143841 this_sequence A143843 A143844 
               A143845
%K A143842 nonn,tabl
%O A143842 0,26
%A A143842 Benoit Jubin (benoit_jubin(AT)yahoo.fr), Sep 02 2008