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
Examples
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;
Links
- Eric Weisstein's World of Mathematics, Hamiltonian Path
- Eric Weisstein's World of Mathematics, Knight Graph