|
| |
|
|
A137568
|
|
Number of chromatically unique simple graphs on n nodes.
|
|
2
| | |
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Chromatically Unique Graph
|
|
|
FORMULA
| A137568(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.
Sequence in context: A027230 A151378 A192464 * A010355 A171880 A171874
Adjacent sequences: A137565 A137566 A137567 * A137569 A137570 A137571
|
|
|
KEYWORD
| nonn,more,hard,changed
|
|
|
AUTHOR
| E. W. Weisstein (eric(AT)weisstein.com), Jan 26, 2008
|
|
|
EXTENSIONS
| a(9) from Eric W. Weisstein (eric(AT)weisstein.com), Apr 07 2008
a(8) and a(9) corrected by Eric W. Weisstein (eric(AT)weisstein.com), Jan 02 2011
|
| |
|
|
