For a given order $n$, the number of graphs that are determined uniquely by their chromatic polynomial is A137568. This sequence starting with n=1 is:
1, 2, 4, 7, 16, 41, 139, 704, 7270, 183606
I am looking for something slightly different, the sequence formed by the number of distinct chromatic polynomials for connected graphs.