Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054927
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054927 Number of connected unlabeled "median" graphs having n nodes such that complement is also connected. +0
1
1, 0, 0, 1, 4, 17, 122, 1512, 32692 (list; graph; listen)
OFFSET

1,5

LINKS

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

FORMULA

A001437(n)+A054926(n)-A000717(n).

CROSSREFS

Sequence in context: A077386 A004140 A032115 this_sequence A071138 A032325 A032335

Adjacent sequences: A054924 A054925 A054926 this_sequence A054928 A054929 A054930

KEYWORD

nonn,easy,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research