|
|
A075094
|
|
Triangle of the sorted orders of graph automorphism groups for the simple graphs.
|
|
0
|
|
|
1, 2, 2, 2, 2, 6, 6, 2, 2, 2, 4, 4, 6, 6, 8, 8, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 6, 6, 8, 8, 8, 8, 10, 12, 12, 12, 12, 12, 12, 24, 24, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
For n>1 row n ends with n!,n! since the automorphism group of the empty graph and the complete graph is the symmetric group. - Geoffrey Critzer, Aug 09 2016
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1;
2, 2;
2, 2, 6, 6;
2, 2, 2, 4, 4, 6, 6, 8, 8, 24, 24;
... (End)
|
|
MATHEMATICA
|
a = {1, 2, 4, 11, 34, 156, 1044};
Table[Sort[Table[GraphData[{n, i}, "AutomorphismCount"], {i, 1, a[[n]]}]], {n, 1, 7}] // Grid (* Geoffrey Critzer, Aug 09 2016 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|