login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A286931 Number of (not necessarily connected) symmetric (edge- and vertex-transitive) graphs with n nodes. 2

%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 vertex-transitive) graphs with n nodes.

%C By convention, empty graphs are considered edge-transitive.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SymmetricGraph.html">Symmetric Graph</a>

%F a(n) = Sum{d|n} 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 26 09:52 EDT 2019. Contains 322472 sequences. (Running on oeis4.)