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.

A290714 Number of irredundant sets in the n X n bishop graph.

Original entry on oeis.org

2, 9, 110, 2116, 59670, 2509056, 147357840, 12001640704, 1321710590682, 196996776086916
Offset: 1

Views

Author

Eric W. Weisstein, Aug 09 2017

Keywords

Links

Crossrefs

Cf. A290712, A290713, A291060.

Formula

a(n) = A290712(n) * A290713(n) for n > 1. - Andrew Howroyd, Aug 10 2017

Extensions

a(5)-a(10) from Andrew Howroyd, Aug 19 2017

A286886 Number of minimal dominating sets in the n X n black bishop graph.

Original entry on oeis.org

1, 2, 5, 19, 84, 425, 2725, 18167, 147458, 1238979
Offset: 1

Views

Author

Eric W. Weisstein, Aug 02 2017

Keywords

Links

Crossrefs

Cf. A287897, A289145, A289164, A290713, A295899.

Extensions

a(7) from Eric W. Weisstein, Nov 29 2017
a(8)-a(10) from Andrew Howroyd, Nov 30 2017

A290712 Number of irredundant sets in the n X n white bishop graph.

Original entry on oeis.org

3, 11, 46, 255, 1584, 12845, 109552, 1239653, 14035554
Offset: 2

Views

Author

Eric W. Weisstein, Aug 09 2017

Keywords

Links

Crossrefs

Cf. A290713, A290714, A291060.

Extensions

a(7)-a(10) from Andrew Howroyd, Aug 19 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.