|
%I #9 Oct 13 2019 18:14:20
%S 0,0,16,0,164,1488,12756,62176,379376,2426224,13367704,72972656,
%T 402564940,2167170608,11412234916,59638462576,308861005448,
%U 1581575598752,8029891390392,40482609620976,202672272980456,1008192626002544,4987067296004984,24540946112970792
%N Number of (directed) Hamiltonian paths on the 4 X n knight graph.
%H Andrew Howroyd, <a href="/A123935/b123935.txt">Table of n, a(n) for n = 1..500</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a>
%F a(n) = 2*A079137(n).
%Y Cf. A079137, A306282.
%K nonn
%O 1,3
%A _N. J. A. Sloane_, Oct 30 2006
%E Terms a(22) and beyond from _Andrew Howroyd_, Oct 13 2019
|
