A006800 Number of connected vertex-transitive graphs with n nodes.

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, 677116, 6759, 132543, 11144, 1962756, 14601, 814155, 48447, 13102946, 52487, 9461929, 99879, 39133822, 399365, 34333611, 364723

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• nice

References

• B. D. McKay, personal communication.
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• B. D. McKay and G. F. Royle, The transitive graphs with at most 26 vertices, Ars Combin. 30 (1990), 161-176. (Annotated scanned copy)
• B. D. McKay and G. F. Royle, The transitive graphs with at most 26 vertices, Ars Combin. 30 (1990), 161-176.
• G. Royle, Transitive graphs
• Steven Skiena, A Database of Graphs in Combinatorica Format.
• Eric Weisstein's World of Mathematics, Vertex-Transitive Graph

Crossrefs

Row sums of A319368.

Cf A006799.

Programs

Mathematica

A006799 = Cases[Import["https://oeis.org/A006799/b006799.txt", "Table"], {, }][[All, 2]];
Table[Sum[MoebiusMu[n/d] A006799[[d]], {d, Divisors[n]}], {n, 1, Length[A006799]}] (* Jean-François Alcover, Aug 20 2019 *)

Formula

Moebius transform of A006799. - Andrew Howroyd, Sep 18 2018

Extensions

More terms from Vladeta Jovovic, Jun 30 2007

a(32)-a(47) from Andrew Howroyd, Nov 27 2018