%I #13 Jul 18 2017 01:38:07
%S 1,1,8,64,1331,64000,6400075,1404928000,677298787768,712186032947200,
%T 1635557819719974912,8209592592625295700893,
%U 90036881979773511965369428,2157454308508779392217680572439
%N Number of matchings in the n-triangular honeycomb acute 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/IndependentEdgeSet.html">Independent Edge Set</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Matching.html">Matching</a>
%Y Cf. A289143, A287204, A289904, A287228, A269869.
%K nonn,more
%O 1,3
%A _Eric W. Weisstein_, May 22 2017
%E a(11) from _Eric W. Weisstein_, Jun 25 2017
%E a(12)-a(14) from _Andrew Howroyd_, Jul 17 2017
|