%I
%S 1,2,2,4,3,7,3,9,6,12,3,20,5,12,14
%N Number of (not necessarily connected) symmetric (edge and vertextransitive) graphs with n nodes.
%C By convention, empty graphs are considered edgetransitive.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SymmetricGraph.html">Symmetric Graph</a>
%F a(n) = Sum{dn} A133181(d).  _Charlie Neder_, Apr 24 2019
%Y Cf. A133181 (number of connected symmetric graphs on n nodes).
%Y Cf. A087145 (number of disconnected symmetric graphs on n nodes).
%K nonn,more,changed
%O 1,2
%A _Eric W. Weisstein_, May 16 2017
%E a(11)a(15) from _Charlie Neder_, Apr 24 2019
