The number of standard Young tableaux possible of shape corresponding to a partition $λ$ is called the dimension of the partition and is denoted by $f^λ$. Partitions with odd dimensions were enumerated by McKay and were further characterized by Macdonald using the theory of 2-core towers. We use the same theory to extend the results to partitions of $n$ with dimensions congruent to 2 modulo 4 which are enumerated by $a_2(n)$. We provide explicit results for $a_2(n)$ when $n$ has no consecutive 1s in its binary expansion and give a recursive formula to compute $a_2(n)$ for all $n$.