Graph Coloring · Challenge problem

With $4$ colors available, the wheel $W_n$ (hub plus an $n$-cycle rim) has chromatic polynomial value $P(W_n,4)$ counting its proper colorings. What is the smallest $n$ for which $P(W_n,4) > 1000$?