The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #8 Jul 01 2017 23:04:56
%S 1,1,2,16,644,10304,65113608,2849759680,118928612871184,
%T 58888109421793792
%N Number of maximum matchings in the n X n knight graph.
%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/KnightGraph.html">Knight Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Matching.html">Matching</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximumIndependentEdgeSet.html">Maximum Independent Edge Set</a>
%t Join[{1, 1}, Table[Length[With[{g = LineGraph[KnightTourGraph[n, n]]}, FindIndependentVertexSet[g, Length /@ FindIndependentVertexSet[g], All]]], {n, 3, 5}]]
%Y Cf. A287225, A289200.
%K nonn,more
%O 1,3
%A _Eric W. Weisstein_, Jun 28 2017
%E a(7)-a(10) from _Andrew Howroyd_, Jul 01 2017