cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A006792 Number of n-node vertex-transitive graphs which are not Cayley graphs.

Original entry on oeis.org

2, 0, 0, 0, 0, 4, 8, 0, 4, 0, 82, 0, 0, 0, 112, 0, 132, 0, 66, 0, 1124, 0, 18170, 0, 920, 6, 4162, 0, 0, 0, 48266, 0, 242, 0, 96, 294, 0, 0
Offset: 10

Views

Author

Keywords

References

  • 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).

Crossrefs

Formula

a(n) = A006799(n) - A185959(n). - Andrew Howroyd, Nov 27 2018

Extensions

More terms from Vladeta Jovovic, Jun 30 2007
a(32)-a(47) from Andrew Howroyd, Nov 27 2018
Duplicate a(32) removed by Andrew Howroyd, Sep 05 2019