|
Search: id:A136868
|
|
|
| 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). |
|
+0
2
|
|
| 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
(list; table; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
