1,4

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 square-free orders

R. Poeschel, Publications

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.

Cf. A049297, A049287, A049289.

Sequence in context: A049911 A056712 A002087 this_sequence A102946 A026094 A069860

Adjacent sequences: A049285 A049286 A049287 this_sequence A049289 A049290 A049291

nonn,nice

V. A. Liskovets (liskov(AT)im.bas-net.by)

Further values for (twice) square-free and (twice) prime-squared orders can be found in the Liskovets reference.