%I #17 Aug 06 2024 06:33:20
%S 1,1,2,2,3,4,8,20,20,30,88,94,214,457,596,1096,3280,5560,7316,21944,
%T 26272,49940
%N Number of nonisomorphic self-complementary circulant digraphs (Cayley digraphs for the cyclic group) of order 2n-1.
%C There is an easy formula for prime orders. Formulae are also known for squarefree and prime-squared orders.
%C Further values for squarefree and prime-squared orders can be found in the Liskovets reference.
%H V. A. Liskovets, <a href="https://arxiv.org/abs/math/0104131">Some identities for enumerators of circulant graphs</a>, arXiv:math/0104131 [math.CO], 2001.
%H V. A. Liskovets and R. Poeschel, <a href="https://citeseerx.ist.psu.edu/pdf/b76573e0c2df2ff117cef015809e232a3747f585">On the enumeration of circulant graphs of prime-power and squarefree orders</a>
%H R. Poeschel, <a href="http://www.math.tu-dresden.de/~poeschel/Publikationen.html">Publications</a>
%Y Cf. A049288, A049289, A049297, A038785.
%K nice,nonn
%O 1,3
%A _Valery A. Liskovets_
%E a(14)-a(22) from _Andrew Howroyd_, May 06 2017