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

0, 2, 4, 192, 25376, 64264704, 1295557991168, 458135084510273536, 2627612220112334649458688

Offset

1,2

Links

Table of n, a(n) for n=1..9.

Eric Weisstein's World of Mathematics, Bishop Graph

Eric Weisstein's World of Mathematics, Longest Path

Formula

a(n) = A234632(n) for n even.

a(n) = A234632(n)/2 for n odd.

Crossrefs

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

Sequence in context: A012367 A165508 A018633 * A018637 A018647 A009743

Adjacent sequences: A307553 A307554 A307555 * A307557 A307558 A307559

Keyword

nonn,more

Author

Eric W. Weisstein, Apr 14 2019

Status

approved