login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A057272
Triangle T(n,k) of number of digraphs with a quasi-source on n labeled nodes and with k arcs, k=0,1,..,n*(n-1).
5
1, 0, 2, 1, 0, 0, 12, 20, 15, 6, 1, 0, 0, 0, 104, 426, 768, 920, 792, 495, 220, 66, 12, 1, 0, 0, 0, 0, 1160, 9184, 32420, 73000, 123425, 166860, 184426, 167900, 125965, 77520, 38760, 15504, 4845, 1140, 190, 20, 1
OFFSET
1,3
LINKS
V. Jovovic and G. Kilibarda, Enumeration of labeled quasi-initially connected digraphs, Discrete Math., 224 (2000), 151-163.
EXAMPLE
Triangle starts:
1;
0,2,1;
0,0,12,20,15,6,1;
0,0,0,104,426,768,920,792,495,220,66,12,1;
...
Number of digraphs with a quasi-source on 3 labeled nodes is 54=12+20+15+6+1.
CROSSREFS
Row sums give A049414. Cf. A057270, A057271, A057273-A057279.
Sequence in context: A201299 A057274 A088632 * A062735 A054547 A202717
KEYWORD
nonn,tabf
AUTHOR
Vladeta Jovovic, Goran Kilibarda, Sep 14 2000
STATUS
approved