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.

A234603 Numbers of undirected cycles in the n X n black bishop graph.

Original entry on oeis.org

2, 53, 12424, 12300529, 504040211574, 84649132742336262, 1080241691057266946999792
Offset: 3

Views

Author

Eric W. Weisstein, Dec 28 2013

Keywords

Links

Crossrefs

Cf. A234630, A234636, A234624, A282889, A234632.

Extensions

a(7) from Eric W. Weisstein, Jan 04 2014
a(3) prepended and a(8)-a(9) from Andrew Howroyd, May 08 2017

A234637 Number of directed Hamiltonian paths in the n X n white bishop graph.

Original entry on oeis.org

2, 8, 192, 24512, 64264704, 784014157824, 458135084510273536, 1135180621552183662673920
Offset: 2

Views

Author

Eric W. Weisstein, Dec 28 2013

Keywords

Links

Crossrefs

Cf. A234632, A096970.

Extensions

a(3) prepended and a(8)-a(9) from Andrew Howroyd, Feb 21 2016
a(2) prepended by Eric W. Weisstein, Nov 16 2016

A307556 Number of (undirected) longest paths in the n X n bishop graph.

Original entry on oeis.org

0, 2, 4, 192, 25376, 64264704, 1295557991168, 458135084510273536, 2627612220112334649458688
Offset: 1

Views

Author

Eric W. Weisstein, Apr 14 2019

Keywords

Links

Crossrefs

Cf. A234632 (number of directed Hamiltonian paths in the n X n black bishop graph).

Formula

a(n) = A234632(n) for n even.
a(n) = A234632(n)/2 for n odd.
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.