%I A049297
%S A049297 1,2,3,6,6,20,14,46,51,140,108,624,352,1440,2172
%N A049297 Number of nonisomorphic circulant digraphs (i.e. Cayley digraphs for 
               the cyclic group) of order n.
%H A049297 V. A. Liskovets, <a href="http://front.math.ucdavis.edu/math.CO/0104131">
               Some identities for enumerators of circulant graphs</a>.
%H A049297 V. A. Liskovets and R. Poeschel, <a href="ftp://ftp.math.tu-dresden.de/
               pub/reports/alg/poeschel/lispoepp.ps">On the enumeration of circulant 
               graphs of prime-power and square-free orders</a>
%H A049297 R. Poeschel, <a href="http://www.math.tu-dresden.de/~poeschel/Publikationen.html">
               Publications</a>
%F A049297 There is an easy formula for prime orders. Formulae are also known for 
               square-free and prime-squared orders. The subsequent values for n=13, 
               14, 15 are 352, 1440, 2172.
%Y A049297 Cf. A049287-A049289.
%Y A049297 Sequence in context: A007894 A102625 A117777 this_sequence A056391 A056430 
               A089878
%Y A049297 Adjacent sequences: A049294 A049295 A049296 this_sequence A049298 A049299 
               A049300
%K A049297 nonn,nice
%O A049297 1,2
%A A049297 V. A. Liskovets (liskov(AT)im.bas-net.by)
%E A049297 Further values for (twice) square-free and (twice) prime-squared orders 
               can be found in the Liskovets reference.