login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A289200 Number of maximal matchings in the n X n knight graph. 3

%I #14 Jun 02 2019 23:43:43

%S 1,1,10,538,94868,59059198

%N Number of maximal matchings in the n X n knight graph.

%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/MaximalIndependentEdgeSet.html">Maximal Independent Edge Set</a>

%t Table[Length[FindIndependentVertexSet[LineGraph[KnightTourGraph[n, n]], Infinity, All]], {n, 5}]

%K nonn,more

%O 1,3

%A _Eric W. Weisstein_, Jun 28 2017

%E a(6) from _Eric W. Weisstein_, Jun 02 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)