login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A330344
Number of unlabeled graphs with n vertices whose covered portion has exactly two automorphisms.
5
0, 1, 2, 4, 13, 50, 367
OFFSET
1,3
FORMULA
Partial sums of A330346.
EXAMPLE
Non-isomorphic representatives of the a(2) = 1 through a(5) = 13 graphs:
{12} {12} {12} {12}
{12,13} {12,13} {12,13}
{12,13,24} {12,13,24}
{12,13,14,23} {12,13,14,23}
{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 A330345.
The covering case is A330346 (not A241454).
Unlabeled graphs are A000088.
Unlabeled graphs with exactly one automorphism are A003400.
Unlabeled connected graphs with exactly one automorphism are A124059.
Graphs with exactly two automorphisms are A330297 (labeled covering), A330344 (unlabeled), A330345 (labeled), and A330346 (unlabeled covering).
Sequence in context: A246012 A069730 A072605 * A161905 A030953 A030811
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Dec 12 2019
STATUS
approved