Eulerian and Hamiltonian Graphs · Challenge problem

The wheel $W_n$ is a hub joined to every vertex of an $n$-cycle. For how many $n$ with $3\le n\le10$ does $W_n$ have an Euler trail (a walk using every edge once, circuit or not)?