id:A143842 - OEIS Search Results

Search: id:A143842

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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 (list; table; graph; listen)

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research