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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054915 Number of unlabeled connected graphs with n nodes such that complement is also connected. 0
1, 0, 0, 1, 8, 68, 662, 9888, 247492, 11427974, 994403266, 163028488360, 50169784370486, 28952819268460634, 31368276315718175152, 63938104521922794457626, 245807799210635120355337360 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

LINKS

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

FORMULA

2*A001349(n)-A000088(n).

CROSSREFS

Sequence in context: A163307 A152105 A068766 * A073555 A167859 A113357

Adjacent sequences:  A054912 A054913 A054914 * A054916 A054917 A054918

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 17 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 15 12:25 EST 2012. Contains 205786 sequences.