|
Search: id:A049288
|
|
|
| A049288 |
|
Number of nonisomorphic circulant tournaments, i.e. Cayley tournaments for cyclic group of order 2n-1. |
|
+0
6
|
|
| 1, 1, 1, 2, 3, 4, 6, 16, 16, 30, 88, 94, 205
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
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
|
|
FORMULA
|
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.
|
|
CROSSREFS
|
Cf. A049297, A049287, A049289.
Cf. A002087. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 15 2008]
Adjacent sequences: A049285 A049286 A049287 this_sequence A049289 A049290 A049291
Sequence in context: A049911 A056712 A002087 this_sequence A102946 A026094 A069860
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
V. A. Liskovets (liskov(AT)im.bas-net.by)
|
|
EXTENSIONS
|
Further values for (twice) square-free and (twice) prime-squared orders can be found in the Liskovets reference.
|
|
|
Search completed in 0.002 seconds
|
