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.

A330346 Number of unlabeled simple graphs covering n vertices with exactly two automorphisms.

Original entry on oeis.org

0, 0, 1, 1, 2, 9, 37
Offset: 0

Views

Author

Gus Wiseman, Dec 12 2019

Keywords

Comments

First differs from A241454 at n = 8.

Examples

			Non-isomorphic representatives of the a(5) = 9 graphs:
  {12,13,14,25}
  {12,13,24,35}
  {12,13,14,23,25}
  {12,13,14,23,45}
  {12,13,15,24,34}
  {12,13,14,15,23,24}
  {12,13,14,23,24,35}
  {12,13,14,23,25,45}
  {12,13,14,15,23,24,35}
		

Crossrefs

The labeled version is A330297.
The non-covering version is A330344.
Unlabeled covering graphs are A002494.
Unlabeled connected graphs with exactly two automorphisms are A241454.
Graphs with exactly two automorphisms are A330297 (labeled covering), A330344 (unlabeled), A330345 (labeled), A330346 (unlabeled covering), A241454 (unlabeled connected).