Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056988
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056988 Number of weakly connected digraphs on n nodes that are not strongly connected. +0
1
0, 1, 8, 116, 4316, 483835, 175048780, 212125583518, 887136857205696, 13086449050056880074, 691487226135525983266460 (list; graph; listen)
OFFSET

1,3

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

A003085(n)-A035512(n)

CROSSREFS

Cf. A003085, A035512.

Sequence in context: A062126 A113670 A156468 this_sequence A085699 A046914 A116008

Adjacent sequences: A056985 A056986 A056987 this_sequence A056989 A056990 A056991

KEYWORD

nonn,more

AUTHOR

Eric Weisstein (eric(AT)weisstein.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research