Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054918
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054918 Number of connected unlabeled digraphs with n nodes such that complement is also connected. +0
1
1, 1, 10, 180, 9120, 1520742, 878908844, 1791588717764, 13024366540532952, 341234368845828951004, 32522226812040344643993088, 11366680383641301437820379768750, 14669062959091969068110415719779627436 (list; graph; listen)
OFFSET

1,3

LINKS

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

FORMULA

2*A003085(n)-A000273(n).

CROSSREFS

Sequence in context: A001762 A034908 A030048 this_sequence A095807 A064092 A121973

Adjacent sequences: A054915 A054916 A054917 this_sequence A054919 A054920 A054921

KEYWORD

nonn,easy

AUTHOR

njas, May 24 2000

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 19 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 September 5 01:44 EDT 2008. Contains 143476 sequences.


AT&T Labs Research