|
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)
|
|
|
OFFSET
|
0,13
|
|
|
COMMENT
|
Partial sums of the rows of A139622, i.e., T(n,k) = sum(T139622(n,p),p=0..k).
T(n,2) = T129620(n,2) - n(n-1)/2.
If k>=n, T(n,k) = A139627(n).
|
|
CROSSREFS
|
Cf. A138107, A129620, A143842.
Sequence in context: A133734 A109702 A115412 this_sequence A035440 A029878 A080934
Adjacent sequences: A143838 A143839 A143840 this_sequence A143842 A143843 A143844
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Benoit Jubin (benoit_jubin(AT)yahoo.fr), Sep 02 2008
|
|
|
Search completed in 0.002 seconds
|
