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

A304555 Number of total dominating sets in the n X n bishop graph.

Original entry on oeis.org

0, 1, 144, 20449, 14758132, 39638819025, 396238966098460, 14867893869236421601, 2126342662340665160447328, 1176421647617108793775585682449, 2547608710158562394293642194477846120, 21773677331809613734748132667414036666780625, 738425493702654527284576776819226860610509488122044
Offset: 1

Views

Author

Eric W. Weisstein, May 14 2018

Keywords

Crossrefs

Formula

a(n) = A303145(n) * A303147(n) for n > 1. - Andrew Howroyd, May 19 2018

Extensions

a(6)-a(10) from Andrew Howroyd, May 19 2018
a(11) onwards from Andrew Howroyd, May 16 2025

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

Original entry on oeis.org

1, 4, 30, 361, 6552, 180625, 6768900, 330039889, 20267217352, 1535068962441
Offset: 1

Views

Author

Eric W. Weisstein, Nov 29 2017

Keywords

Crossrefs

Formula

a(n) = A286886(n) * A287897(n). - Andrew Howroyd, Nov 30 2017

Extensions

a(6)-a(10) from Andrew Howroyd, Nov 30 2017
Showing 1-2 of 2 results.