# How to justify if the nth term of the sequence is even or odd?

Consider the sequence $a_n$ = $a_{n-1} \cdot a_{n-2} + n$ for $n \geq 2$ with $a_0 = 1$ and $a_1 = 1$. Is $a_{2011}$ even or odd? Please justify.

-
What have you tried? Is this homework? –  JavaMan Apr 21 '11 at 2:11
Please don't yell. Words in all caps (such as ODD and EVEN) are interpreted as if you are shouting. –  Arturo Magidin Apr 21 '11 at 2:32
Consider the same sequence, but mod 2. Try a few terms. Prove the pattern by induction. –  lhf Apr 21 '11 at 2:36

HINT $\rm\ \ mod\ 2\::\ \ a_{n-2}\ \equiv\ n-2,\ \ a_{n-1}\ \equiv\ n-1\ \ \Rightarrow\ \ a_n\ \equiv\ n\:.\:$ Hence once the parity of $\rm\:a_n\:$ is the same as its index $\rm\:n\:$ for two successive indices, it remains so for all larger indices (by induction).
Hint: Suppose $n$ is even. The parities of $a_{n-1},a_{n-2}$ completely determine the parities of $a_{n+1},a_n$.