Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054917
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054917 Number of connected unlabeled vertex-transitive graphs with n nodes such that complement is also connected. +0
1
0, 0, 0, 1, 2, 2, 6, 5, 14 (list; graph; listen)
OFFSET

1,5

LINKS

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

FORMULA

2*A006800(n)-A006799(n).

CROSSREFS

Sequence in context: A144160 A115255 A055924 this_sequence A111419 A056881 A060779

Adjacent sequences: A054914 A054915 A054916 this_sequence A054918 A054919 A054920

KEYWORD

nonn,easy,more

AUTHOR

njas, May 24 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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research