A270273 - 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

A270273

Array read by antidiagonals: T(n,m) = number of Hamiltonian cycles in C_n X C_m.

0, 0, 0, 1, 1, 1, 1, 3, 3, 1, 1, 6, 48, 6, 1, 1, 5, 126, 126, 5, 1, 1, 8, 390, 1344, 390, 8, 1, 1, 7, 1014, 2930, 2930, 1014, 7, 1, 1, 10, 2982, 28060, 23580, 28060, 2982, 10, 1, 1, 9, 8094, 55230, 145210, 145210, 55230, 8094, 9, 1

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

OFFSET

1,8

LINKS

Andrew Howroyd, Table of n, a(n) for n = 1..191

Artem M. Karavaev, Hamilton Cycles

Eric Weisstein's World of Mathematics, Hamiltonian Cycle

Eric Weisstein's World of Mathematics, Torus Grid Graph

FORMULA

T(n,2) = A124349(n) / 2.

EXAMPLE

The start of the sequence as table: