|
Search: id:A057279
|
|
|
| A057279 |
|
Triangle T(n,k) of number of digraphs with a quasi-source on n unlabeled nodes and with k arcs, k=0,1,..,n*(n-1). |
|
+0
10
|
|
| 1, 0, 1, 1, 0, 0, 3, 4, 4, 1, 1, 0, 0, 0, 7, 21, 37, 47, 38, 27, 13, 5, 1, 1, 0, 0, 0, 0, 18, 90, 309, 661, 1125, 1477, 1665, 1489, 1154, 707, 379, 154, 61, 16, 5, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
REFERENCES
|
V. Jovovic, G. Kilibarda, Enumeration of labeled quasi-initially connected digraphs, Discrete Math., 224 (2000), 151-163.
|
|
EXAMPLE
|
[1],[0,1,1],[0,0,3,4,4,1,1],[0,0,0,7,21,37,47,38,27,13,5,1,1],...; Number of digraphs with a quasi-source on 3 unlabeled nodes is 13=3+4+4+1+1.
|
|
CROSSREFS
|
Row sums give A049512. Cf. A057270-A057278.
Sequence in context: A108658 A021748 A132723 this_sequence A054733 A120649 A001009
Adjacent sequences: A057276 A057277 A057278 this_sequence A057280 A057281 A057282
|
|
KEYWORD
|
more,nonn,tabf
|
|
AUTHOR
|
Vladeta Jovovic, Goran Kilibarda (vladeta(AT)eunet.rs), Sep 14 2000
|
|
|
Search completed in 0.002 seconds
|
