A289202 Number of maximum matchings in the n X n knight graph.

1, 1, 2, 16, 644, 10304, 65113608, 2849759680, 118928612871184, 58888109421793792

Offset

1,3

Links

Table of n, a(n) for n=1..10.

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

Cf. A287225, A289200.

Sequence in context: A012757 A012464 A277036 * A279324 A128294 A278087

Adjacent sequences: A289199 A289200 A289201 * A289203 A289204 A289205

Keyword

nonn,more

Author

Eric W. Weisstein, Jun 28 2017

Extensions

a(7)-a(10) from Andrew Howroyd, Jul 01 2017

Status

approved