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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275867 Number of simple disconnected asymmetric graph on n vertices. 2
0, 0, 0, 0, 0, 0, 8, 144, 3552, 131452, 7840396 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

COMMENTS

Interestingly (and perhaps obviously?), For n > 2, a(n) = A124059(n-1).

REFERENCES

1

LINKS

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

Eric Weisstein's World of Mathematics, Graph Automorphism

Eric Weisstein's World of Mathematics, Identity Graph

FORMULA

a(n) = A003400(n) - A124059(n).

For n > 2, a(n) = A124059(n-1) (conjectured; perhaps provable/obvious?).

CROSSREFS

Cf. A003400 (not-necessarily connected simple asymmetric graphs).

Cf. A124059 (connected simple asymmetric graphs).

Sequence in context: A061899 A134492 A067421 * A124059 A052764 A024284

Adjacent sequences:  A275864 A275865 A275866 * A275868 A275869 A275870

KEYWORD

nonn

AUTHOR

Eric W. Weisstein, May 19 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 November 19 06:03 EST 2019. Contains 329310 sequences. (Running on oeis4.)