login
A182161
Number of extensional acyclic digraphs on n labeled nodes.
3
1, 1, 2, 12, 216, 10560, 1297440, 381013920, 258918871680, 398362519618560, 1366301392119014400, 10325798296570753920000, 170397664079650720884864000, 6094923358716319193283074457600, 469649545161250827117772066578739200, 77556106803568453086056722450983544320000
OFFSET
0,3
LINKS
S. Wagner, Asymptotic enumeration of extensional acyclic digraphs, in Proceedings of the SIAM Meeting on Analytic Algorithmics and Combinatorics (ANALCO12).
FORMULA
a(n) = n!*A001192(n).
CROSSREFS
Cf. A001192, A003024. Row sums of A182162.
Sequence in context: A153302 A123118 A367051 * A165950 A208651 A083667
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 15 2012
STATUS
approved