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.

A291705 Number of connected dominating sets in the n X n knight graph.

Original entry on oeis.org

1, 0, 0, 11140, 6635521, 7249082465, 35733685780960
Offset: 1

Views

Author

Eric W. Weisstein, Aug 30 2017

Keywords

Links

Crossrefs

Cf. A287071, A290765.

Extensions

a(6)-a(7) from Andrew Howroyd, Sep 04 2017

A362498 Number of vertex cuts in the n X n knight graph.

Original entry on oeis.org

0, 0, 256, 48745, 22577890, 50785004331, 447911805432769, 15359769797452095985
Offset: 1

Views

Author

Eric W. Weisstein, Apr 22 2023

Keywords

Links

Crossrefs

Cf. A290765.

Formula

a(n) = 2^(n^2) - 1 - A290765(n) for n >= 4. - Pontus von Brömssen, Apr 23 2023

Extensions

a(6)-a(8) (based on data in A290765) from Pontus von Brömssen, Apr 23 2023
Showing 1-2 of 2 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.