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
1, 2, 2, 4, 3, 7, 3, 9, 6, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

By convention, empty graphs are considered edge-transitive.

LINKS

Table of n, a(n) for n=1..10.

Eric Weisstein's World of Mathematics, Symmetric Graph

CROSSREFS

Cf. A133181 (number of connected symmetric graphs on n nodes).

Cf. A087145 (number of disconnected symmetric graphs on n nodes).

Sequence in context: A101200 A122585 A057449 * A265701 A007439 A238622

Adjacent sequences:  A286928 A286929 A286930 * A286932 A286933 A286934

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, May 16 2017

STATUS

approved

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 March 19 19:32 EDT 2019. Contains 321330 sequences. (Running on oeis4.)