|
%I #19 Oct 04 2017 19:42:08
%S 2,12,130,9492,1166928,1431128744,2907639077764,76670800431934272,
%T 3341096345926174809912,2311650738313947870105792416,
%U 2645105778378736719464340469683304,56641723029988800376624313271476598959936
%N Number of matchings in the n X n black bishop graph.
%C Matchings are not necessarily perfect matchings.
%C C# software that can be used to compute this sequence can be found in A270228.
%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/IndependentEdgeSet.html">Independent Edge Set</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Matching.html">Matching</a>
%Y Cf. A286423, A287248, A270228, A216078 (independent vertex sets), A234603 (cycles).
%K nonn
%O 2,1
%A _Andrew Howroyd_, May 08 2017
| 