Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054915
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054915 Number of unlabeled connected graphs with n nodes such that complement is also connected. +0
1
1, 0, 0, 1, 8, 68, 662, 9888, 247492, 11427974, 994403266, 163028488360, 50169784370486, 28952819268460634, 31368276315718175152, 63938104521922794457626, 245807799210635120355337360 (list; graph; listen)
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 this_sequence A073555 A113357 A030992

Adjacent sequences: A054912 A054913 A054914 this_sequence 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

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research