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

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, 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, 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

Offset

0,26

Comments

Partial sums of the rows of A139625, i.e., T(n,k) = sum(T139625(n,p),p=0..k).

If k>=floor(sqrt(n)), T(n,k) = A139630(n).

Links

Table of n, a(n) for n=0..99.

Crossrefs

Cf. A138352, A136868, A143841.

Sequence in context: A273107 A194329 A321749 * A369460 A092876 A187360

Adjacent sequences: A143839 A143840 A143841 * A143843 A143844 A143845

Keyword

nonn,tabl

Author

Benoit Jubin, Sep 02 2008

Status

approved