%I A136868
%S A136868 1,1,0,1,1,0,1,2,1,0,1,2,4,1,0,1,2,6,7,1,0,1,2,6,14,12,1,0,1,2,6,17
%N A136868 Table read by antidiagonals: T(n,k) is the number of 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 A136868 Partial sums of the rows of A139624, i.e., T(n,k) = sum(T139624(n,p),
               p=0..k).
%C A136868 T(0,k) = 1 for k>=0; T(n,0) = 0 and T(n,1) = 1 for n>0.
%C A136868 If k>=n+1, T(n,k) = A139629(n).
%e A136868 Triangle begins:
%e A136868 1,
%e A136868 1, 0,
%e A136868 1, 1, 0,
%e A136868 1, 2, 1, 0,
%e A136868 1, 2, 4, 1, 0,
%e A136868 1, 2, 6, 7, 1, 0,
%e A136868 1, 2, 6,14,12, 1, 0,
%Y A136868 Cf. A138352.
%Y A136868 Sequence in context: A062329 A022958 A023444 this_sequence A145895 A114503 
               A103528
%Y A136868 Adjacent sequences: A136865 A136866 A136867 this_sequence A136869 A136870 
               A136871
%K A136868 more,nonn,tabl
%O A136868 0,8
%A A136868 Benoit Jubin (benoit_jubin(AT)yahoo.fr), May 11 2008