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!)
A056988 Number of weakly connected digraphs on n unlabeled nodes that are not strongly connected. 1
0, 1, 8, 116, 4316, 483835, 175048780, 212125583518, 887136857205696, 13086449050056880074, 691487226135525983266460, 132437909864451274070001431956, 92821692762628588679459049647697100, 239928160288841627346208269001938306502290 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Connected Digraph.
FORMULA
a(n) = A003085(n) - A035512(n).
CROSSREFS
Sequence in context: A235338 A231553 A291077 * A085699 A046914 A364984
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(12)-a(14) added by Andrew Howroyd, Dec 27 2021
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 May 7 03:41 EDT 2024. Contains 372300 sequences. (Running on oeis4.)