1,2
V. A. Liskovets, Some identities for enumerators of circulant graphs.
V. A. Liskovets and R. Poeschel, On the enumeration of circulant graphs of prime-power and squarefree orders
R. Poeschel, Publications
There is an easy formula for prime orders. Formulae are also known for squarefree and prime-squared orders. The subsequent values for n=13, 14, 15 are 352, 1440, 2172.
Cf. A049287-A049289.
Sequence in context: A007894 A102625 A117777 * A056391 A056430 A089878
Adjacent sequences: A049294 A049295 A049296 * A049298 A049299 A049300
nonn,nice
V. A. Liskovets (liskov(AT)im.bas-net.by)
Further values for (twice) squarefree and (twice) prime-squared orders can be found in the Liskovets reference.
