This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A286422 #20 Feb 16 2025 08:33:45 %S A286422 2,12,130,9492,1166928,1431128744,2907639077764,76670800431934272, %T A286422 3341096345926174809912,2311650738313947870105792416, %U A286422 2645105778378736719464340469683304,56641723029988800376624313271476598959936 %N A286422 Number of matchings in the n X n black bishop graph. %C A286422 Matchings are not necessarily perfect matchings. %C A286422 C# software that can be used to compute this sequence can be found in A270228. %H A286422 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BlackBishopGraph.html">Black Bishop Graph</a> %H A286422 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependentEdgeSet.html">Independent Edge Set</a> %H A286422 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Matching.html">Matching</a> %Y A286422 Cf. A286423, A287248, A270228, A216078 (independent vertex sets), A234603 (cycles). %K A286422 nonn %O A286422 2,1 %A A286422 _Andrew Howroyd_, May 08 2017