A175554 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A175554

Number of Hamiltonian cycle decompositions of the complete graph on 2n+1 vertices.

0

1, 6, 960, 40037760

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..4.

Douglas S. Stones, Hamiltonian cycle decompositions of the complete graph. MathOverflow.

CROSSREFS

Sequence in context: A076667 A000652 A214638 * A263423 A266598 A250392

Adjacent sequences: A175551 A175552 A175553 * A175555 A175556 A175557

KEYWORD

bref,hard,more,nonn

AUTHOR

Max Alekseyev, Jun 28 2010

EXTENSIONS

a(1)-a(4) were computed by Douglas S. Stones.

STATUS

approved