|
%I #35 Aug 03 2017 04:11:29
%S 1,1,1,2,3,4,6,16,16,30,88,94,205,457,586,1096,3280,5472,7286,21856,
%T 26216,49940,174848,182362,399472,1048576,1290556,3355456,7456600,
%U 9256396,17895736,59654816,89478656,130150588,390451576,490853416,954437292
%N Number of nonisomorphic circulant tournaments, i.e., Cayley tournaments for cyclic group of order 2n-1.
%C Further values for prime-squared orders can be found in A038789.
%C There is an easy formula for prime orders. Formulae are also known for squarefree and prime-squared orders.
%H B. Alspach, <a href="/A002086/a002086.pdf">On point-symmetric tournaments</a>, Canad. Math. Bull., 13 (1970), 317-323. [Annotated copy] See r(n).
%H B. Alspach, <a href="http://dx.doi.org/10.4153/CMB-1970-061-7">On point-symmetric tournaments</a>, Canad. Math. Bull., 13 (1970), 317-323. See r(n).
%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="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.89">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>
%H <a href="/index/To#tournament">Index entries for sequences related to tournaments</a>
%F a(n) <= A002086(n). - _Andrew Howroyd_, Apr 28 2017
%F a(n) = A002086(n) for squarefree 2n-1. - _Andrew Howroyd_, Apr 28 2017
%Y Cf. A002086, A002087, A038789, A049297, A049287, A049289, A060966.
%K nonn,nice
%O 1,4
%A _Valery A. Liskovets_
%E a(14)-a(37) from _Andrew Howroyd_, Apr 28 2017
%E Reference to Alspach (1970) corrected by _Andrew Howroyd_, Apr 28 2017
|
