`a(n)` is the number of partitions of `n` that does not contain `2` as a part. For example, `a(4)=3` because `4=3+1=1+1+1+1` and `a(5)=4` because `5=4+1=3+1+1=1+1+1+1+1`.
Find `a(n)`.