$a_n = a_{n-1} \cdot a_{n-2} + n$, $n\ge2$, $a_0 = 1$ and $a_1 = 1$. Is $a_{2011}$ odd. Why so?
This is not a homework problem. I am appearing for an exam soon and I am solving sample questions for the exam. I don't know how to go ahead solving this.
So far I found out $a_2, a_3, a_4, a_5, a_6$ and $a_7$ but could not spot any pattern.
$a_{2011} = a_{2010} \cdot a_{2009} + 2011~$. So I am adding an odd number with the product, so whether or not the number is odd depends entirely on the product. This is as far as I could think.
$a_n\bmod 2$ depends only on $a_{n-1}\bmod 2$, $a_{n-2}\bmod 2$, and $n\bmod 2$. We can describe the transition $(n\bmod 2,a_{n}\bmod 2,a_{n-1}\bmod 2)\mapsto (n+1\bmod 2,a_{n+1}\bmod 2,a_{n}\bmod 2)$ by the following table $$\begin{matrix}(0,0,0)&\mapsto&(1,1,0)\\(0,0,1)&\mapsto&(1,0,0)\\ (0,1,0)&\mapsto&(1,0,1)\\ (0,1,1)&\mapsto&(1,0,1)\\ (1,0,0)&\mapsto&(0,0,0)\\ (1,0,1)&\mapsto&(0,1,0)\\ (1,1,0)&\mapsto&(0,1,1)\\ (1,1,1)&\mapsto&(0,1,1)\\\end{matrix} $$ and we start with $(1,1,1)$. The sequence will be eventually periodic and this allows you to predict the triple (and hence parity of $a_n$) belonging to $n=2011$.