Sorry @Melody and @Jamesaiden, they were both wrong. The correct answer was 20. Here was the solution they gave:
The residue of 4n(mod 6) is determined by the residue of n (mod 6). We can build a table showing the possibilities(it doesn't render, but here it is with words)
n (mod 6) 0 1 2 3 4 5
----------------------------------------------------------------------------------------------------
4n (mod 6) 0 4 2 0 4 2
As the table shows, 4n=2 (mod 6) is true when n=2 or n=5 (mod 6). Otherwise, it's false.
So, our problem is to count all n between 0 and 60 that leave a remainder of 2 or 5 (mod 6). These integers are 2, 5, 8, 11, 14, 17, ... , 56, 59.
There are $\boxed{20}$ integers in this list.
Thank you both for trying, however! :)