|
Search: id:A057276
|
|
|
| A057276 |
|
Triangle T(n,k) of number of strongly connected digraphs on n unlabeled nodes and with k arcs, k=0,1,..,n*(n-1). |
|
+0
4
|
|
| 1, 0, 0, 1, 0, 0, 0, 1, 2, 1, 1, 0, 0, 0, 0, 1, 4, 16, 22, 22, 11, 5, 1, 1, 0, 0, 0, 0, 0, 1, 7, 58, 240, 565, 928, 1065, 953, 640, 359, 150, 59, 16, 5, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,9
|
|
|
EXAMPLE
|
[1],[0,0,1],[0,0,0,1,2,1,1],[0,0,0,0,1,4,16,22,22,11,5,1,1],...; Number of strongly connected digraphs on 3 unlabeled nodes is 5=1+2+1+1.
|
|
CROSSREFS
|
Row sums give A035512. Cf. A057270-A057275, A057277-A057279.
Sequence in context: A064663 A025923 A138158 this_sequence A035185 A086013 A064692
Adjacent sequences: A057273 A057274 A057275 this_sequence A057277 A057278 A057279
|
|
KEYWORD
|
more,nonn,tabf
|
|
AUTHOR
|
Vladeta Jovovic, Goran Kilibarda (vladeta(AT)Eunet.yu), Sep 14 2000
|
|
|
Search completed in 0.002 seconds
|
