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.

A304553 Number of total dominating sets in the n-triangular honeycomb bishop graph.

Original entry on oeis.org

0, 3, 29, 578, 22361, 1640001, 230504570, 62711805029, 33349745638405, 34939148029874116, 72519613634620549271, 299330052017563038619309, 2462757900094871658430161896, 40447266466705082294217088869999, 1327138203952448478777157651757710177, 87038459949342074077614931718690581743298
Offset: 1

Views

Author

Eric W. Weisstein, May 14 2018

Keywords

Links

Crossrefs

Cf. A290941, A304558, A304564.

Programs

Extensions

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

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

Original entry on oeis.org

0, 1, 16, 1, 8, 3721, 108, 10816, 6568440, 72900, 31449600, 34117784100, 165564000, 210350649600, 402994899820800, 965895840000, 2867571383040000, 9255560083943040000, 12074509581120000, 72211625896757760000, 373919369489319044160000, 286361814021766560000, 3107808843778161008640000
Offset: 1

Views

Author

Eric W. Weisstein, Nov 16 2018

Keywords

Links

Crossrefs

Cf. A303141 (black bishop graph).
Cf. A303144 (white bishop graph).
Cf. A304555, A304564, A321674.

Programs

Formula

a(n) = A303141(n) * A303144(n). - Andrew Howroyd, Nov 16 2018

Extensions

a(8)-a(10) from Andrew Howroyd, Nov 16 2018
a(11) from Eric W. Weisstein, Apr 03 2025
a(12) onwards from Andrew Howroyd, May 16 2025

A304558 Number of minimal total dominating sets in the n-triangular honeycomb bishop graph.

Original entry on oeis.org

0, 2, 4, 36, 203, 1854, 18188, 214646, 2909712
Offset: 1

Views

Author

Eric W. Weisstein, May 14 2018

Keywords

Links

Crossrefs

Cf. A290875, A304553, A304564.

Extensions

a(7)-a(9) from Andrew Howroyd, May 19 2018

A382777 Number of minimum total dominating sets in the (3n)-triangular honeycomb bishop graph.

Original entry on oeis.org

1, 2, 21, 540, 25740, 1965600, 219769200, 33844456800, 6868433880000, 1776393899280000, 570349326947400000, 222585024290428800000, 103769138324197906560000, 56957727035726406489600000, 36357688414546530128697600000, 26705308554813693259046592000000, 22364482036994885663848836864000000
Offset: 0

Views

Author

Andrew Howroyd, Apr 04 2025

Keywords

Comments

The total domination number is 2*n.

Links

Crossrefs

Row sums of A382776.
Cf. A304564.

Programs

  • PARI
    a(n) = sum(k=0, n, binomial(2*n-k,k)*binomial(n+k,n-k)*(2*(n-k))!*(2*k)!)/(2^n)

Formula

a(n) = Sum_{k=0..n} binomial(2*n-k,k)*binomial(n+k,n-k)*(2*(n-k))!*(2*k)!/(2^n).
a(n) = A304564(3*n) for n > 0.
Showing 1-4 of 4 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.