login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038375 Maximal number of spanning paths in tournament on n nodes. 0
3, 5, 15, 45, 189 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

REFERENCES

K. B. Reid and L. W. Beineke "Tournaments", pp. 169-204 in L. W. Beineke and R. J. Wilson, editors, Selected Topics in Graph Theory, Academic Press, NY, 1978.

J. W. Moon, Topics on Tournaments. Holt, NY, 1968, p. 28.

LINKS

Table of n, a(n) for n=3..7.

Index entries for sequences related to tournaments

CROSSREFS

Sequence in context: A103425 A119472 A018568 * A103043 A018601 A190733

Adjacent sequences:  A038372 A038373 A038374 * A038376 A038377 A038378

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 7 17:16 EST 2016. Contains 278890 sequences.