login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026586 Number of labeled essential directed acyclic graphs (DAGs). 0
1, 1, 1, 4, 59, 2616, 306117, 87716644, 58874478231, 90018247082416, 307775459402071913, 2322338398654088751036, 38293189001166839643861795, 1369158635491114830895696234696, 105480725505896171175318367295035341 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
Bertran Steinsky, Enumeration of labelled chain graphs and labeled essential directed acyclic graphs, Discrete Mathematics, 270 (2003), 267-278.
FORMULA
a(0)=1, a(n) = Sum_{k=1..n} (-1)^(k+1) * binomial(n, k) * (2^(n-k)-n+k) * a(n-k) [from Steinsky]. - Sean A. Irvine, Oct 06 2019
CROSSREFS
Sequence in context: A264820 A194534 A331712 * A298064 A298713 A058173
KEYWORD
nonn
AUTHOR
Detlef Pauly (dettodet(AT)yahoo.de), Aug 22 2003
EXTENSIONS
a(0)=1 inserted by Sean A. Irvine, Oct 06 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)