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”).
%I #14 Apr 25 2019 03:57:45
%S 0,1,1,2,1,3,1,4,2,4,1,9,1,4,4,9,1,11,1,14,4,4,1,25,3,6,6,14,1,27,1
%N Number of distinct disconnected simple symmetric graphs on n nodes.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SymmetricGraph.html">Symmetric Graph</a>
%F a(n) = Sum{d|n, d<n} A133181(d). - _Charlie Neder_, Apr 24 2019
%Y Cf. A133181 (number of connected symmetric graphs).
%Y Cf. A286931 (number of not necessarily connected symmetric graphs).
%K nonn,more
%O 1,4
%A _Eric W. Weisstein_, Aug 19 2003
%E Corrected and extended by _David Wasserman_, Feb 14 2006
%E a(12)-a(31) from _Charlie Neder_, Apr 24 2019