Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054949
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054949 Number of labeled semi-strong digraphs on n nodes with an odd number of components. +0
1
1, 1, 19, 1612, 565276, 734799976, 3523103676184, 63519230066936512, 4400411105398828102336, 1190433708177460323642937216, 1270463865199882936737403300783744, 5381067966904826663696685903449569172992, 90765788839502187660342772995967835888789034496 (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: A047910 A051847 A002115 this_sequence A068748 A098846 A116012

Adjacent sequences: A054946 A054947 A054948 this_sequence A054950 A054951 A054952

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