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-4 of 4 results.

A289145 Number of connected dominating sets in the n X n black bishop graph.

Original entry on oeis.org

1, 3, 16, 128, 4528, 176192, 25823200, 3695526272
Offset: 1

Views

Author

Eric W. Weisstein, Jun 26 2017

Keywords

Crossrefs

Extensions

a(8) from Andrew Howroyd, Sep 04 2017

A290769 Number of (non-null) connected induced subgraphs in the n X n white bishop graph.

Original entry on oeis.org

3, 13, 168, 2844, 194751, 14062789, 3852814320, 1039212524160
Offset: 2

Views

Author

Eric W. Weisstein, Aug 10 2017

Keywords

Crossrefs

Extensions

a(8)-a(9) from Andrew Howroyd, Aug 15 2017

A291595 Number of (non-null) connected induced subgraphs in the n X n bishop graph.

Original entry on oeis.org

1, 6, 35, 336, 8095, 389502, 41541383, 7705628640, 3104759041723
Offset: 1

Views

Author

Eric W. Weisstein, Aug 27 2017

Keywords

Crossrefs

Formula

a(n) = A290719(n) + A290769(n) for n > 1. - Andrew Howroyd, Aug 27 2017

Extensions

a(6)-a(9) from Andrew Howroyd, Aug 27 2017

A362509 Number of vertex cuts in the n X n black bishop graph.

Original entry on oeis.org

0, 0, 9, 87, 2940, 67392, 6075837, 442152975, 133476737988
Offset: 1

Views

Author

Eric W. Weisstein, Apr 23 2023

Keywords

Crossrefs

Cf. A290719.

Formula

a(n) = 2^ceiling(n^2/2) - 1 - A290719(n). - Pontus von Brömssen, Apr 23 2023

Extensions

a(8)-a(9) (based on data in A290719) from Pontus von Brömssen, Apr 23 2023
Showing 1-4 of 4 results.