login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006800 Number of connected vertex-transitive 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), 161-176.

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.

Eric Weisstein's World of Mathematics, Vertex-Transitive Graph

Steven Skiena, A Database of Graphs in Combinatorica Format.

CROSSREFS

Sequence in context: A163298 A133440 A160793 * A241820 A190170 A147524

Adjacent sequences:  A006797 A006798 A006799 * A006801 A006802 A006803

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Vladeta Jovovic, Jun 30 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 19:19 EST 2016. Contains 278770 sequences.