login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137568 Number of chromatically unique simple graphs on n nodes. 3
1, 2, 4, 7, 16, 41, 139, 704, 7270, 183606 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Eric Weisstein's World of Mathematics, Chromatic Polynomial

Eric Weisstein's World of Mathematics, Chromatically Unique Graph

FORMULA

a(n) = A000088(n) - A137567(n).

PROG

(Sage)

def A137568(n):

....d = {}

....for g in graphs(n):

........c = g.chromatic_polynomial()

........d[c] = 1 if c not in d else d[c]+1

....return d.values().count(1)  # D. S. McNeil, Jan 02 2011

CROSSREFS

Cf. A137567 (number of chromatically non-unique graphs).

Cf. A000088 (number of simple graphs).

Sequence in context: A260790 A151378 A192464 * A010355 A171880 A171874

Adjacent sequences:  A137565 A137566 A137567 * A137569 A137570 A137571

KEYWORD

nonn,more,hard

AUTHOR

Eric W. Weisstein, Jan 26 2008

EXTENSIONS

a(9) from Eric W. Weisstein, Apr 07 2008

a(8) and a(9) corrected by Eric W. Weisstein, Jan 02 2011

a(10) from Eric W. Weisstein, Jun 09 2014

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 January 25 23:04 EST 2020. Contains 331270 sequences. (Running on oeis4.)