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.

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

This page as a plain text file.
%I A307556 #6 Feb 16 2025 08:33:55
%S A307556 0,2,4,192,25376,64264704,1295557991168,458135084510273536,
%T A307556 2627612220112334649458688
%N A307556 Number of (undirected) longest paths in the n X n bishop graph.
%H A307556 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BishopGraph.html">Bishop Graph</a>
%H A307556 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LongestPath.html">Longest Path</a>
%F A307556 a(n) = A234632(n) for n even.
%F A307556 a(n) = A234632(n)/2 for n odd.
%Y A307556 Cf. A234632 (number of directed Hamiltonian paths in the n X n black bishop graph).
%K A307556 nonn,more
%O A307556 1,2
%A A307556 _Eric W. Weisstein_, Apr 14 2019