A306282 Triangle read by rows: T(n,k) is the number of (directed) Hamiltonian paths in the n X k knight graph.

1, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 164, 1728, 0, 0, 0, 1488, 37568, 6637920, 0, 0, 104, 12756, 1245736, 779938932, 165575218320, 0, 0, 792, 62176, 36122108

Offset

1,9

Links

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

Eric Weisstein's World of Mathematics, Hamiltonian Path

Eric Weisstein's World of Mathematics, Knight Graph

Example

Triangle begins:
n\k | 1  2    3      4        5          6             7
----+----------------------------------------------------
1   | 1;
2   | 0, 0;
3   | 0, 0,   0;
4   | 0, 0,  16,     0;
5   | 0, 0,   0,   164,    1728;
6   | 0, 0,   0,  1488,   37568,   6637920;
7   | 0, 0, 104, 12756, 1245736, 779938932, 165575218320;

Crossrefs

T(n,n) gives A165134.

Cf. A118067, A123935.

Sequence in context: A181029 A072838 A023919 * A336432 A169767 A225611

Adjacent sequences: A306279 A306280 A306281 * A306283 A306284 A306285

Keyword

nonn,tabl,more

Author

Seiichi Manyama, Feb 03 2019

Status

approved