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”).

Number of maximal matchings in the n X n black bishop graph.
2

%I #10 Jan 04 2018 07:41:06

%S 1,1,5,30,1140,69136,33666336,27406992000,234805387040640,

%T 3472530332565934080,660908229459858361516032,

%U 217930756388573091682145009664

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

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BlackBishopGraph.html">Black Bishop 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>

%Y Cf. A286422, A297471, A297490.

%K nonn,more

%O 1,3

%A _Eric W. Weisstein_, Dec 30 2017

%E a(7)-a(12) from _Andrew Howroyd_, Dec 30 2017