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

A241455
Number of simple connected graphs g on n nodes with |Aut(g)| = 4
19
0, 0, 0, 1, 3, 28, 198, 1971, 29047, 672516
OFFSET
1,5
LINKS
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014
Eric Weisstein's World of Mathematics, Graph Automorphism
CROSSREFS
Cf. Values of |Aut(g)| for simple connected graphs, A124059, A241454, A241455, A241456, A241457, A241458, A241459, A241460, A241461, A241462, A241463, A241464, A241465, A241466, A241467, A241468, A241469, A241470, A241471.
Sequence in context: A366689 A160872 A081019 * A356975 A278183 A091120
KEYWORD
nonn
AUTHOR
Travis Hoppe and Anna Petrone, Apr 23 2014
STATUS
approved