Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054942
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054942 Number of connected oriented graphs on n nodes with an even number of edges. +0
1
1, 0, 12, 304, 27664, 6990848, 5179182272, 11396324423680, 74944172893348096, 1476405354971703541760, 87208352627656970763963392, 15450530398306943408624578330624, 8211400756816955708062672329408385024 (list; graph; listen)
OFFSET

1,3

LINKS

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

CROSSREFS

Sequence in context: A041264 A109867 A014130 this_sequence A052795 A053064 A060010

Adjacent sequences: A054939 A054940 A054941 this_sequence A054943 A054944 A054945

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 24 2000

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), 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 November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research