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.

A357003 Number of Hamiltonian cycles in the cyclic Haar graph with index n.

This page as a plain text file.
%I A357003 #8 Sep 17 2022 09:53:54
%S A357003 0,0,1,0,1,1,6,0,1,0,6,1,6,6,72,0,1,1,8,1,8,8,156,1,8,8,156,8,156,156,
%T A357003 1440,0,1,0,8,0,12,12,335,0,12,0,300,12,352,300,4800,1,8,12,335,12,
%U A357003 300,352,4800,8,335,300,4800,335,4800,4800,43200,0,1,1,10,1
%N A357003 Number of Hamiltonian cycles in the cyclic Haar graph with index n.
%C A357003 a(n) > 0 for all odd n >= 3 (Hladnik, Marušič, and Pisanski, 2002).
%H A357003 Pontus von Brömssen, <a href="/A357003/b357003.txt">Table of n, a(n) for n = 1..2047</a>
%H A357003 Milan Hladnik, Dragan Marušič, and Tomaž Pisanski, <a href="https://doi.org/10.1016/S0012-365X(01)00064-4">Cyclic Haar graphs</a>, Discrete Mathematics 244 (2002), 137-152.
%H A357003 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HaarGraph.html">Haar Graph</a>.
%F A357003 a(2^k-1) = A010796(k-1) for k >= 2.
%F A357003 a(A291165(n)) = 0.
%F A357003 a(n) = a(A357004(n)).
%Y A357003 Cf. A010796, A291165, A357000, A357004.
%K A357003 nonn
%O A357003 1,7
%A A357003 _Pontus von Brömssen_, Sep 08 2022