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

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

Offset: 1

Author

Eric W. Weisstein, Apr 14 2019

Keywords

• nonn
• more

Links

• Eric Weisstein's World of Mathematics, Bishop Graph
• Eric Weisstein's World of Mathematics, Longest Path

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.