The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A175554

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A175554

Number of Hamiltonian cycle decompositions of the complete graph on 2n+1 vertices.
(history; published version)

#5 by Max Alekseyev at Tue Jan 08 14:12:10 EST 2019

STATUS

editing

approved

#4 by Max Alekseyev at Tue Jan 08 14:12:05 EST 2019

COMMENTS

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

EXTENSIONS

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

STATUS

approved

editing

#3 by N. J. A. Sloane at Tue Jan 01 06:34:05 EST 2019

LINKS

Douglas S. Stones, <a href="http://mathoverflow.net/questions/10577/hamilton-cycle-decompositions-of-the-complete-graph">Hamilton Hamiltonian cycle decompositions of the complete graph</a>. MathOverflow.

Discussion

Tue Jan 01

06:34

OEIS Server: https://oeis.org/edit/global/2785

#2 by Russ Cox at Fri Mar 30 17:27:05 EDT 2012

AUTHOR

_Max Alekseyev (maxale(AT)gmail.com), _, Jun 28 2010

Discussion

Fri Mar 30

17:27

OEIS Server: https://oeis.org/edit/global/140

#1 by N. J. A. Sloane at Sun Jul 11 03:00:00 EDT 2010

NAME

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

DATA

1, 6, 960, 40037760

OFFSET

1,2

COMMENTS

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

LINKS

Douglas S. Stones, <a href="http://mathoverflow.net/questions/10577/hamilton-cycle-decompositions-of-the-complete-graph">Hamilton cycle decompositions of the complete graph</a>. MathOverflow.

KEYWORD

bref,hard,more,nonn,new

AUTHOR

Max Alekseyev (maxale(AT)gmail.com), Jun 28 2010

STATUS

approved