%I #12 Aug 17 2020 13:17:44
%S 1,1,2,12,216,10560,1297440,381013920,258918871680,398362519618560,
%T 1366301392119014400,10325798296570753920000,
%U 170397664079650720884864000,6094923358716319193283074457600,469649545161250827117772066578739200,77556106803568453086056722450983544320000
%N Number of extensional acyclic digraphs on n labeled nodes.
%H S. Wagner, <a href="http://math.sun.ac.za/swagner/DigraphsFull.pdf">Asymptotic enumeration of extensional acyclic digraphs</a>, in Proceedings of the SIAM Meeting on Analytic Algorithmics and Combinatorics (ANALCO12).
%F a(n) = n!*A001192(n).
%Y Cf. A001192, A003024. Row sums of A182162.
%K nonn
%O 0,3
%A _N. J. A. Sloane_, Apr 15 2012
|