login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..15.

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: A292812 A153302 A123118 * A165950 A208651 A083667

Adjacent sequences:  A182158 A182159 A182160 * A182162 A182163 A182164

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Apr 15 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 22:22 EDT 2021. Contains 348119 sequences. (Running on oeis4.)