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.
%I A330346 #11 Dec 22 2019 19:13:47
%S A330346 0,0,1,1,2,9,37
%N A330346 Number of unlabeled simple graphs covering n vertices with exactly two automorphisms.
%C A330346 First differs from A241454 at n = 8.
%H A330346 Gus Wiseman, <a href="/A330346/a330346.png">The a(5) = 9 graphs with exactly two automorphisms.</a>
%e A330346 Non-isomorphic representatives of the a(5) = 9 graphs:
%e A330346 {12,13,14,25}
%e A330346 {12,13,24,35}
%e A330346 {12,13,14,23,25}
%e A330346 {12,13,14,23,45}
%e A330346 {12,13,15,24,34}
%e A330346 {12,13,14,15,23,24}
%e A330346 {12,13,14,23,24,35}
%e A330346 {12,13,14,23,25,45}
%e A330346 {12,13,14,15,23,24,35}
%Y A330346 The labeled version is A330297.
%Y A330346 The non-covering version is A330344.
%Y A330346 Unlabeled covering graphs are A002494.
%Y A330346 Unlabeled connected graphs with exactly two automorphisms are A241454.
%Y A330346 Graphs with exactly two automorphisms are A330297 (labeled covering), A330344 (unlabeled), A330345 (labeled), A330346 (unlabeled covering), A241454 (unlabeled connected).
%Y A330346 Cf. A000088, A003400, A055621, A124059, A330098, A330227, A330230, A330231, A330294, A330295, A330343.
%K A330346 nonn,more
%O A330346 0,5
%A A330346 _Gus Wiseman_, Dec 12 2019