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”).
%I #27 Mar 08 2016 03:14:08
%S 1,24,784,343184,729237344,13089822163800,1659110130720710584,
%T 1635069460917798701270872,12308784500036123518164726610224,
%U 721833220650131890343295654587745095696,330596986686626406483380599328509951896788808144
%N Number of directed Hamiltonian paths on the n X n king graph.
%C Number of open directed king's tours on the n X n board.
%H Ville H. Pettersson, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p7">Enumerating Hamiltonian Cycles</a>, The Electronic Journal of Combinatorics, Volume 21, Issue 4, 2014.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HamiltonianPath.html">Hamiltonian Path</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/KingGraph.html">King Graph</a>
%H <a href="/index/Gra#graphs">Index entries for sequences related to graphs, Hamiltonian</a>
%Y Cf. A003763, A096969, A137891, A140521.
%K nonn,more
%O 1,2
%A _Eric W. Weisstein_, Mar 23 2009
%E a(5) from _Max Alekseyev_, May 03 2009
%E a(6)-a(11) from _Andrew Howroyd_, Nov 15 2015