A182161 Number of extensional acyclic digraphs on n labeled nodes.
1, 1, 2, 12, 216, 10560, 1297440, 381013920, 258918871680, 398362519618560, 1366301392119014400, 10325798296570753920000, 170397664079650720884864000, 6094923358716319193283074457600, 469649545161250827117772066578739200, 77556106803568453086056722450983544320000
Offset: 0
Keywords
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).