Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054953
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054953 Number of labeled semi-strong digraphs on n nodes with an odd number of pairwise different components. +0
1
1, 1, 5, 83, 5048, 1047013, 705422455, 1580348377261, 12139024826336632, 328160951350054991463, 31831080872414173375174213 (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: A142162 A082546 A035512 this_sequence A111834 A006471 A061628

Adjacent sequences: A054950 A054951 A054952 this_sequence A054954 A054955 A054956

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research