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.

A286422 Number of matchings in the n X n black bishop graph.

Original entry on oeis.org

2, 12, 130, 9492, 1166928, 1431128744, 2907639077764, 76670800431934272, 3341096345926174809912, 2311650738313947870105792416, 2645105778378736719464340469683304, 56641723029988800376624313271476598959936
Offset: 2

Views

Author

Andrew Howroyd, May 08 2017

Keywords

Comments

Matchings are not necessarily perfect matchings.
C# software that can be used to compute this sequence can be found in A270228.

Crossrefs

Cf. A286423, A287248, A270228, A216078 (independent vertex sets), A234603 (cycles).