Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054950
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054950 Number of labeled semi-strong digraphs on n nodes with an even number of components. +0
1
0, 1, 3, 76, 8220, 3418216, 5156362008, 28205998918336, 571801003320734400, 44006976469834509225856, 13095012982298536065778624128, 15245644966564725709168192019570176, 69953982671396722666217758540260522923520, 1270721533437616701720124856867026526491583190016 (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: A042267 A141103 A054747 this_sequence A065993 A097802 A119200

Adjacent sequences: A054947 A054948 A054949 this_sequence A054951 A054952 A054953

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research