The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Eric Weisstein's World of Mathematics, Graph Automorphism EXAMPLE From Geoffrey Critzer, Aug 09 2016: (Start) 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 Cf. A003400, A000088 (row lengths). Sequence in context: A304794 A175809 A061033 * A238413 A151704 A110023 Adjacent sequences:  A075091 A075092 A075093 * A075095 A075096 A075097 KEYWORD nonn,tabf AUTHOR Eric W. Weisstein, Aug 31 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 7 12:47 EDT 2022. Contains 355148 sequences. (Running on oeis4.)