login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054913 Number of labeled connected graphs with n nodes such that complement is also connected. 0
1, 0, 0, 12, 432, 20640, 1635360, 234661728, 63873105408, 33808605100800, 35254518078942720, 72922216118695037952, 300312950395670884227072, 2467417543490126920783534080, 40490542668157619621325008117760 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

LINKS

V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.

FORMULA

2*A001187(n)-A006125(n).

CROSSREFS

Sequence in context: A123778 A129006 A067429 * A070285 A041617 A159534

Adjacent sequences:  A054910 A054911 A054912 * A054914 A054915 A054916

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 23 2000

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 19 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 19:37 EST 2012. Contains 205663 sequences.