Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054951
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054951 Number of unlabeled semi-strong digraphs on n nodes with mutually nonisomorphic components. +0
1
1, 1, 4, 78, 4960, 1041872, 704369984, 1579641879248, 12137443766888448, 328148810741254606592, 31830752699315833628787200 (list; graph; listen)
OFFSET

1,3

REFERENCES

V. A. Liskovets, A contribution to the enumeration of strongly connected digraphs, Dokl. AN BSSR, 17 (1973), 1077-1080 (Russian), MR49#4849.

LINKS

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

CROSSREFS

Cf. A035512, A049387.

Adjacent sequences: A054948 A054949 A054950 this_sequence A054952 A054953 A054954

Sequence in context: A052271 A080989 A006267 this_sequence A048957 A006425 A065930

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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research