The number of standard Young tableaux of shape 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. Let $a_i(n)$ be the number of partitions of $n$ with dimension congruent to $i$ modulo 4. In this paper, we refine Macdonald's and McKay's results by computing $a_1(n)$ and $a_3(n)$ when $n$ has no consecutive 1s in its binary expansion or when the sum of binary digits of $n$ is 2.