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.

Showing 1-3 of 3 results.

A286423 Number of matchings in the n X n white bishop graph.

Original entry on oeis.org

2, 7, 130, 4207, 1166928, 541240697, 2907639077764, 25886034363696809, 3341096345926174809912, 713738790204487208874991935, 2645105778378736719464340469683304, 16238808907214611705432043192158547965751
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.

Links

Crossrefs

Cf. A286422, A287248, A270228, A216332 (independent vertex sets), A234630 (cycles).

A234603 Numbers of undirected cycles in the n X n black bishop graph.

Original entry on oeis.org

2, 53, 12424, 12300529, 504040211574, 84649132742336262, 1080241691057266946999792
Offset: 3

Views

Author

Eric W. Weisstein, Dec 28 2013

Keywords

Links

Crossrefs

Cf. A234630, A234636, A234624, A282889, A234632.

Extensions

a(7) from Eric W. Weisstein, Jan 04 2014
a(3) prepended and a(8)-a(9) from Andrew Howroyd, May 08 2017

A234636 Numbers of undirected cycles in the n X n bishop graph.

Original entry on oeis.org

0, 3, 106, 17367, 24601058, 638520866656, 169298265484672524, 1292856744880357036357430
Offset: 2

Views

Author

Eric W. Weisstein, Dec 28 2013

Keywords

Links

Formula

a(n) = A234603(n) + A234630(n).

Extensions

a(7) corrected and a(8)-a(9) from Andrew Howroyd, May 08 2017
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.