|
Search: id:A057271
|
|
|
| A057271 |
|
Triangle T(n,k) of number of digraphs with a source and a sink on n labeled nodes and k arcs, k=0,1,..,n*(n-1). |
|
+0
3
|
|
| 1, 0, 2, 1, 0, 0, 6, 20, 15, 6, 1, 0, 0, 0, 24, 234, 672, 908, 792, 495, 220, 66, 12, 1, 0, 0, 0, 0, 120, 2544, 16880, 55000, 111225, 161660, 183006, 167660, 125945, 77520, 38760, 15504, 4845, 1140, 190, 20, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
V. Jovovic, G. Kilibarda, Enumeration of labeled initially-finally connected digraphs, Scientific review, Serbian Scientific Society, 19-20 (1996), p. 245.
V. Jovovic, G. Kilibarda, Enumeration of labeled quasi-initially connected digraphs, Discrete Math., 224 (2000),151-163.
|
|
EXAMPLE
|
[1],[0,2,1],[0,0,6,20,15,6,1],[0,0,0,24,234,672,908,792,495,220,66,12,1],...; Number of digraphs with a source and a sink on 3 labeled nodes is 48=6+20+15+6+1.
|
|
CROSSREFS
|
Row sums give A049524. Cf. A057270, A057272-A057279.
Sequence in context: A057150 A105868 A057275 this_sequence A021480 A057274 A088632
Adjacent sequences: A057268 A057269 A057270 this_sequence A057272 A057273 A057274
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Vladeta Jovovic, Goran Kilibarda (vladeta(AT)eunet.rs), Sep 14 2000
|
|
|
Search completed in 0.002 seconds
|
