login
A289202
Number of maximum matchings in the n X n knight graph.
1
1, 1, 2, 16, 644, 10304, 65113608, 2849759680, 118928612871184, 58888109421793792
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Independent Edge Set
Eric Weisstein's World of Mathematics, Knight Graph
Eric Weisstein's World of Mathematics, Matching
Eric Weisstein's World of Mathematics, Maximum Independent Edge Set
MATHEMATICA
Join[{1, 1}, Table[Length[With[{g = LineGraph[KnightTourGraph[n, n]]}, FindIndependentVertexSet[g, Length /@ FindIndependentVertexSet[g], All]]], {n, 3, 5}]]
CROSSREFS
Sequence in context: A012757 A012464 A277036 * A279324 A128294 A278087
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Jun 28 2017
EXTENSIONS
a(7)-a(10) from Andrew Howroyd, Jul 01 2017
STATUS
approved