  The orbital chromatic polynomial introduced by Cameron and Kayibi counts the
number of proper $\lambda$-colorings of a graph modulo a group of symmetries.
In this paper, we establish expansions for the orbital chromatic polynomial of
the $n$-cycle for the group of rotations and its full automorphism group.
Besides, we obtain a new proof of Fermat's Little Theorem.
