A297490 -id:A297490 - cp's OEIS frontend

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

1, 1, 10, 900, 647520, 4779786496, 478835488935936, 751143210488064000000, 21219054324352295044090429440, 12058466910590476741745310502905446400, 152894149853918130236030979823862137011289718784, 47493814580095591414083394894826323264052517057498653392896

Offset: 1

Eric W. Weisstein, Dec 30 2017

nonn

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

Cf. A287248, A297472, A297490.

a(n) = A297472(n) * A297490(n). - Andrew Howroyd, Dec 30 2017

a(6)-a(12) from Andrew Howroyd, Dec 30 2017

A297472 Number of maximal matchings in the n X n black bishop graph.

Original entry on oeis.org

1, 1, 5, 30, 1140, 69136, 33666336, 27406992000, 234805387040640, 3472530332565934080, 660908229459858361516032, 217930756388573091682145009664

Offset: 1

Eric W. Weisstein, Dec 30 2017

Eric Weisstein's World of Mathematics, Black Bishop Graph
Eric Weisstein's World of Mathematics, Matching
Eric Weisstein's World of Mathematics, Maximal Independent Edge Set

Cf. A286422, A297471, A297490.

a(7)-a(12) from Andrew Howroyd, Dec 30 2017

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

Formula