|
|
A049287
|
|
Number of nonisomorphic circulant graphs, i.e., undirected Cayley graphs for the cyclic group of order n.
|
|
15
|
|
|
1, 2, 2, 4, 3, 8, 4, 12, 8, 20, 8, 48, 14, 48, 44, 84, 36, 192, 60, 336, 200, 416, 188, 1312, 423, 1400, 928, 3104, 1182, 8768, 2192, 8364, 6768, 16460, 11144, 46784, 14602, 58288, 44424, 136128, 52488, 355200, 99880, 432576, 351424, 762608, 364724, 2122944, 798952, 3356408
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Further values for (twice) squarefree and (twice) prime-squared orders can be found in the Liskovets reference.
Terms may be computed by filtering potentially isomorphic graphs of A285620 through nauty. - Andrew Howroyd, Apr 29 2017
|
|
LINKS
|
|
|
FORMULA
|
There is an easy formula for prime orders. Formulae are also known for squarefree and prime-squared orders.
a(n) = A285620(n) for n squarefree or twice square free.
(End)
|
|
MATHEMATICA
|
CountDistinct /@ Table[CanonicalGraph[CirculantGraph[n, #]] & /@ Subsets[Range[Floor[n/2]]], {n, 25}] (* Eric W. Weisstein, May 13 2017 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|