|
%I #11 Aug 16 2016 10:02:33
%S 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,
%T 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,
%U 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
%N Triangle of the sorted orders of graph automorphism groups for the simple graphs.
%C 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
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GraphAutomorphism.html">Graph Automorphism</a>
%e From _Geoffrey Critzer_, Aug 09 2016: (Start)
%e Triangle begins:
%e 1;
%e 2, 2;
%e 2, 2, 6, 6;
%e 2, 2, 2, 4, 4, 6, 6, 8, 8, 24, 24;
%e ... (End)
%t a = {1, 2, 4, 11, 34, 156, 1044};
%t Table[Sort[Table[GraphData[{n, i}, "AutomorphismCount"], {i, 1, a[[n]]}]], {n,1, 7}] // Grid (* _Geoffrey Critzer_, Aug 09 2016 *)
%Y Cf. A003400, A000088 (row lengths).
%K nonn,tabf
%O 1,2
%A _Eric W. Weisstein_, Aug 31 2002
|
