cp's OEIS Frontend

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.

A286423 Number of matchings in the n X n white bishop graph.

This page as a plain text file.
%I A286423 #21 Feb 16 2025 08:33:45
%S A286423 2,7,130,4207,1166928,541240697,2907639077764,25886034363696809,
%T A286423 3341096345926174809912,713738790204487208874991935,
%U A286423 2645105778378736719464340469683304,16238808907214611705432043192158547965751
%N A286423 Number of matchings in the n X n white bishop graph.
%C A286423 Matchings are not necessarily perfect matchings.
%C A286423 C# software that can be used to compute this sequence can be found in A270228.
%H A286423 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependentEdgeSet.html">Independent Edge Set</a>
%H A286423 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Matching.html">Matching</a>
%H A286423 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WhiteBishopGraph.html">White Bishop Graph</a>
%Y A286423 Cf. A286422, A287248, A270228, A216332 (independent vertex sets), A234630 (cycles).
%K A286423 nonn
%O A286423 2,1
%A A286423 _Andrew Howroyd_, May 08 2017