Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054914
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054914 Number of labeled connected digraphs with n nodes such that complement is also connected. +0
1
1, 2, 44, 3572, 1005584, 1060875152, 4382913876704, 71987098738435232, 4721068803628864289024, 1237845578934919489219757312, 1298046978912816702510086132201984 (list; graph; listen)
OFFSET

1,2

LINKS

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

FORMULA

2*A003027(n)-A053763(n).

CROSSREFS

Sequence in context: A161744 A054732 A161722 this_sequence A161745 A048566 A041241

Adjacent sequences: A054911 A054912 A054913 this_sequence A054915 A054916 A054917

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 24 23:11 EST 2009. Contains 167435 sequences.


AT&T Labs Research