login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A297471
Number of maximal matchings in the n X n bishop graph.
3
1, 1, 10, 900, 647520, 4779786496, 478835488935936, 751143210488064000000, 21219054324352295044090429440, 12058466910590476741745310502905446400, 152894149853918130236030979823862137011289718784, 47493814580095591414083394894826323264052517057498653392896
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Bishop Graph
Eric Weisstein's World of Mathematics, Matching
Eric Weisstein's World of Mathematics, Maximal Independent Edge Set
FORMULA
a(n) = A297472(n) * A297490(n). - Andrew Howroyd, Dec 30 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Dec 30 2017
EXTENSIONS
a(6)-a(12) from Andrew Howroyd, Dec 30 2017
STATUS
approved