The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Apr 16 2019 21:40:41
%S 0,2,4,192,25376,64264704,1295557991168,458135084510273536,
%T 2627612220112334649458688
%N Number of (undirected) longest paths in the n X n bishop graph.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BishopGraph.html">Bishop Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LongestPath.html">Longest Path</a>
%F a(n) = A234632(n) for n even.
%F a(n) = A234632(n)/2 for n odd.
%Y Cf. A234632 (number of directed Hamiltonian paths in the n X n black bishop graph).
%K nonn,more
%O 1,2
%A _Eric W. Weisstein_, Apr 14 2019