login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A297471 Number of maximal matchings in the n X n bishop graph. 3

%I #10 Jan 04 2018 07:41:13

%S 1,1,10,900,647520,4779786496,478835488935936,751143210488064000000,

%T 21219054324352295044090429440,12058466910590476741745310502905446400,

%U 152894149853918130236030979823862137011289718784,47493814580095591414083394894826323264052517057498653392896

%N Number of maximal matchings in the n X n bishop graph.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BishopGraph.html">Bishop Graph</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Matching.html">Matching</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximalIndependentEdgeSet.html">Maximal Independent Edge Set</a>

%F a(n) = A297472(n) * A297490(n). - _Andrew Howroyd_, Dec 30 2017

%Y Cf. A287248, A297472, A297490.

%K nonn

%O 1,3

%A _Eric W. Weisstein_, Dec 30 2017

%E a(6)-a(12) from _Andrew Howroyd_, Dec 30 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)