

A006800


Number of connected vertextransitive graphs with n nodes.
(Formerly M0345)


1



1, 1, 1, 2, 2, 5, 3, 10, 7, 18, 7, 64, 13, 51, 44, 272, 35, 365, 59, 1190, 235, 807, 187, 15422, 461, 4221, 1425, 25792, 1181, 46236, 2191
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


REFERENCES

B. D. McKay, personal communication.
McKay, Brendan D.; Royle, Gordon F.; The transitive graphs with at most 26 vertices. Ars Combin. 30 (1990), 161176.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS

Table of n, a(n) for n=1..31.
B. D. McKay and G. F. Royle, The transitive graphs with at most 26 vertices, Ars Combin. 30 (1990), 161176. (Annotated scanned copy)
G. Royle, Transitive graphs
Steven Skiena, A Database of Graphs in Combinatorica Format.
Eric Weisstein's World of Mathematics, VertexTransitive Graph


CROSSREFS

Sequence in context: A163298 A133440 A160793 * A241820 A190170 A147524
Adjacent sequences: A006797 A006798 A006799 * A006801 A006802 A006803


KEYWORD

nonn,nice,more


AUTHOR

N. J. A. Sloane.


EXTENSIONS

More terms from Vladeta Jovovic, Jun 30 2007


STATUS

approved



