The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A140519 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A140519

Number of (undirected) Hamiltonian cycles on the n X n king graph.
(history; published version)

#33 by Charles R Greathouse IV at Thu Mar 19 20:10:03 EDT 2020

STATUS

proposed

approved

#32 by Pontus von Brömssen at Thu Mar 19 05:59:23 EDT 2020

STATUS

editing

proposed

Discussion

Thu Mar 19

20:10

Charles R Greathouse IV: Thank you for the clarification!

#31 by Pontus von Brömssen at Thu Mar 19 05:55:14 EDT 2020

COMMENTS

Or, number of Hamiltonian cycles in the graph P_n X P_n (strong product of two paths of length n-1).

STATUS

approved

editing

Discussion

Thu Mar 19

05:59

Pontus von Brömssen: Clarified that the graph product means the strong product in this case. It seems that "X" is mostly used for Cartesian product, for example in A270273 and A288637.

#30 by N. J. A. Sloane at Mon May 06 15:51:25 EDT 2019

STATUS

proposed

approved

#29 by Eric W. Weisstein at Mon May 06 15:45:17 EDT 2019

STATUS

editing

proposed

#28 by Eric W. Weisstein at Mon May 06 15:44:12 EDT 2019

EXTENSIONS

New name from Eric W. Weisstein, May 06 2019

STATUS

proposed

editing

#27 by Eric W. Weisstein at Mon May 06 15:09:28 EDT 2019

STATUS

editing

proposed

Discussion

Mon May 06

15:41

Michel Marcus: please add extension New name from

#26 by Eric W. Weisstein at Mon May 06 15:09:27 EDT 2019

NAME

Number of "king tours" (undirected) Hamiltonian cycles on an the n X n boardking graph.

STATUS

approved

editing

#25 by Bruno Berselli at Tue Jun 20 11:01:43 EDT 2017

STATUS

reviewed

approved

#24 by Joerg Arndt at Tue Jun 20 10:20:30 EDT 2017

STATUS

proposed

reviewed