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.

A286070 Number of maximum matchings in the n X n bishop graph.

This page as a plain text file.
%I A286070 #16 Feb 16 2025 08:33:44
%S A286070 1,1,10,64,47360,12616704,2300823263232,78291621480960000
%N A286070 Number of maximum matchings in the n X n bishop graph.
%H A286070 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BishopGraph.html">Bishop Graph</a>
%H A286070 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependentEdgeSet.html">Independent Edge Set</a>
%H A286070 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Matching.html">Matching</a>
%H A286070 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximumIndependentEdgeSet.html">Maximum Independent Edge Set</a>
%F A286070 a(n) = A297559(n)*A297566(n). - _Pontus von Brömssen_, Nov 22 2020
%Y A286070 Cf. A297559, A297566.
%K A286070 nonn,more
%O A286070 1,3
%A A286070 _Eric W. Weisstein_, Jun 15 2017