login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A289200
Number of maximal matchings in the n X n knight graph.
3
1, 1, 10, 538, 94868, 59059198
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Knight Graph
Eric Weisstein's World of Mathematics, Matching
Eric Weisstein's World of Mathematics, Maximal Independent Edge Set
MATHEMATICA
Table[Length[FindIndependentVertexSet[LineGraph[KnightTourGraph[n, n]], Infinity, All]], {n, 5}]
CROSSREFS
Sequence in context: A180476 A003399 A180359 * A014382 A325147 A370733
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Jun 28 2017
EXTENSIONS
a(6) from Eric W. Weisstein, Jun 02 2019
STATUS
approved