|
Search: id:A143841
|
|
|
| A143841 |
|
Table read by antidiagonals: T(n,k) is the number of strongly connected directed multigraphs with loops with n arcs and k vertices. |
|
+0
2
|
|
| 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 4, 7, 1, 0, 1, 1, 2, 4
(list; table; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
