Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054947
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054947 Enumerates pairs consisting of a strongly connected labeled tournament and an arbitrary labeled tournament. +0
2
1, 0, 16, 1536, 557056, 731381760, 3517947314176, 63491024068018176, 4399839304395507367936, 1190389701200990489133711360, 1270450770186900638201337522159616, 5381052721259860098970976735257549602816, 90765718885519516263620106778209295628266110976 (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: A160251 A106176 A086815 this_sequence A071900 A145406 A160306

Adjacent sequences: A054944 A054945 A054946 this_sequence A054948 A054949 A054950

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research