Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054943
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054943 Number of connected oriented graphs on n nodes with an odd number of edges. +0
1
0, 2, 8, 320, 27584, 6991360, 5179178368, 11396324458496, 74944172892993536, 1476405354971707604992, 87208352627656970712229888, 15450530398306943408625302896640, 8211400756816955708062672318337859584 (list; graph; listen)
OFFSET

1,2

LINKS

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

CROSSREFS

Sequence in context: A013086 A012536 A012541 this_sequence A013135 A012999 A013003

Adjacent sequences: A054940 A054941 A054942 this_sequence A054944 A054945 A054946

KEYWORD

nonn,easy

AUTHOR

njas, May 24 2000

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 11 2003

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 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research