login
A286280
Number of connected arc-transitive graphs of order n.
2
1, 1, 2, 2, 4, 2, 5, 4, 8, 2, 11, 4, 8, 10, 15, 4, 14, 3, 22, 13, 8, 2, 34, 11, 13, 20, 26, 4, 41
OFFSET
2,3
COMMENTS
Care is needed with "symmetric" terminology, which is variously used to mean both arc-transitive and both vertex- and edge-transitive.
The first known difference from A133181 (connected vertex- and edge-transitive graphs on n vertices) occurs at a(27), corresponding to the Doyle graph (which is both edge- and vertex-transitive but not arc-transitive). - Eric W. Weisstein, May 13 2017
LINKS
Marston Conder, Home Page (Contains tables of regular maps, hypermaps and polytopes, trivalent symmetric graphs, and surface actions)
Eric Weisstein's World of Mathematics, Arc-Transitive Graph
Eric Weisstein's World of Mathematics, Doyle Graph
Eric Weisstein's World of Mathematics, Edge-Transitive Graph
Eric Weisstein's World of Mathematics, Symmetric Graph
Eric Weisstein's World of Mathematics, Vertex-Transitive Graph
CROSSREFS
Cf. A133181 (number of connected vertex- and edge-transitive graphs on n vertices).
Cf. A180240 (number of arc-transitive simple graphs on n nodes).
Sequence in context: A241814 A088371 A133181 * A290088 A179013 A090397
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, May 08 2017
STATUS
approved