OFFSET
1,8
REFERENCES
V. Jovovic, G. Kilibarda, Enumeration of labeled initially-finally connected digraphs, Scientific review, Serbian Scientific Society, 19-20 (1996), p. 246.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..2680 (rows 1..20)
EXAMPLE
Triangle begins:
[1],
[0,1,1],
[0,0,1,4,4,1,1],
[0,0,0,1,11,31,45,38,27,13,5,1,1],
...
The number of digraphs with a source and a sink on 3 unlabeled nodes is 11 = 1+4+4+1+1.
PROG
(PARI) \\ See PARI link in A350794 for program code.
{ my(A=A057278triang(5)); for(n=1, #A, print(A[n])) } \\ Andrew Howroyd, Jan 21 2022
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Vladeta Jovovic, Goran Kilibarda, Sep 14 2000
EXTENSIONS
Terms a(46) and beyond from Andrew Howroyd, Jan 21 2022
STATUS
approved