|
%I #17 May 21 2019 23:40:22
%S 0,0,0,0,0,168,0,1476036
%N Number of (undirected) Hamiltonian paths in the n-triangular honeycomb obtuse knight graph.
%H Stan Wagon, <a href="https://doi.org/10.4169/college.math.j.45.4.278">Graph Theory Problems from Hexagonal and Traditional Chess</a>, The College Mathematics Journal, Vol. 45, No. 4, (September 2014), pp. 278-287.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HamiltonianPath.html">Hamiltonian Path</a>
%K nonn,more
%O 1,6
%A _Eric W. Weisstein_, May 18 2019
|
