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.

A297471 Number of maximal matchings in the n X n bishop graph.

This page as a plain text file.
%I A297471 #11 Feb 16 2025 08:33:52
%S A297471 1,1,10,900,647520,4779786496,478835488935936,751143210488064000000,
%T A297471 21219054324352295044090429440,12058466910590476741745310502905446400,
%U A297471 152894149853918130236030979823862137011289718784,47493814580095591414083394894826323264052517057498653392896
%N A297471 Number of maximal matchings in the n X n bishop graph.
%H A297471 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BishopGraph.html">Bishop Graph</a>
%H A297471 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Matching.html">Matching</a>
%H A297471 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentEdgeSet.html">Maximal Independent Edge Set</a>
%F A297471 a(n) = A297472(n) * A297490(n). - _Andrew Howroyd_, Dec 30 2017
%Y A297471 Cf. A287248, A297472, A297490.
%K A297471 nonn
%O A297471 1,3
%A A297471 _Eric W. Weisstein_, Dec 30 2017
%E A297471 a(6)-a(12) from _Andrew Howroyd_, Dec 30 2017