Let $a_n$ be the number of paths from $(0,0)$ to $(n,2)$ on a grid using only steps of the form $(+1, 0)$ and $(0, +1)$, such that the path never goes above the line $y = x$. What is the value of $a_3$?