|
%I #6 Apr 04 2018 20:21:58
%S 0,0,0,9,369,931320,1243953489
%N Number of (undirected) paths in the n-triangular honeycomb obtuse knight graph.
%H Stan Wagon, <a href="http://www.jstor.org/stable/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/GraphPath.html">Graph Path</a>
%K nonn,more
%O 1,4
%A _Eric W. Weisstein_, Apr 02 2018
|
