Is there an explicit formula for the number of fourth powers mod n?

Finch & Sebah [1] give theorems, partially folklore, for squares and cubes mod n, but I don't know of a similar formula for higher powers.

[1] S. R. Finch and Pascal Sebah, Squares and Cubes Modulo n