Search: id:A049288
Results 1-1 of 1 results found.
%I A049288
%S A049288 1,1,1,2,3,4,6,16,16,30,88,94,205
%N A049288 Number of nonisomorphic circulant tournaments, i.e. Cayley tournaments
for cyclic group of order 2n-1.
%H A049288 V. A. Liskovets,
Some identities for enumerators of circulant graphs.
%H A049288 V. A. Liskovets and R. Poeschel, On the enumeration of circulant
graphs of prime-power and square-free orders
%H A049288 R. Poeschel,
Publications
%F A049288 There is an easy formula for prime orders. Formulae are also known for
square-free and prime-squared orders. The subsequent values for orders
29, 31 are 586, 1096.
%Y A049288 Cf. A049297, A049287, A049289.
%Y A049288 Cf. A002087. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 15
2008]
%Y A049288 Sequence in context: A049911 A056712 A002087 this_sequence A102946 A026094
A069860
%Y A049288 Adjacent sequences: A049285 A049286 A049287 this_sequence A049289 A049290
A049291
%K A049288 nonn,nice
%O A049288 1,4
%A A049288 V. A. Liskovets (liskov(AT)im.bas-net.by)
%E A049288 Further values for (twice) square-free and (twice) prime-squared orders
can be found in the Liskovets reference.
Search completed in 0.001 seconds