|
Search: id:A139621
|
|
|
| A139621 |
|
Table read by rows: T(n,k) is the number of connected directed multigraphs with loops and no vertex of degree 0, with n arcs and k vertices. |
|
+0
5
|
|
| 1, 1, 1, 4, 3, 1, 8, 15, 8, 1, 16
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
