For generality, let x=2011. Expanding the first few terms of the sequence with the recurrence un=xun−1−un−2 we find
u0u3u4u5u6=0,u1=1,u2=x=x2−1=u22−u12=x3−2x=2u3u2−xu22=x4−3x2+1=u32−u22=x5−4x3+2x=2u4u3−xu32.
From this we can conjecture that u2n=2unun+1−xun2 and u2n+1=un+12−un2 for n>0. We now prove this by induction. Firstly note that it holds for n=1. Now assume it holds up to n, and we will show that it holds for n+1.
u2n+2=xu2n+1−u2n=x(un+12−un2)−(2unun+1−xun2)=xun+12−2unun+1+xun2=2un+1(xun+1−un)−xun+12=2un+1un+2−xun+12
and
u2n+3=xu2n+2−u2n+1
=x(2un+1un+2−xun+12)−(un+12−un2)=−x2un+12+x(2un+1un+2)+un2−un+12=x2un+12−2xun+1un+un2−un+12=(xun+1−un)2−un+12=un+22−un+12.
The result thus follows by induction.
The above identities suggest that we may be able to find explicit factorisations, but for a factorisation to prove that a number is not prime it is necessary for the factors to be greater than 1. So let us show that ui−ui−1≥2 for all i≥2. For i=2 the result holds by inspection. Suppose it holds for some i. Then ui+1−ui=2011ui−ui−1−ui=2010ui−ui−1≥ui−ui−1≥2. The result again follows by induction.
Inspecting the first few terms, we see that u2=2011 is prime. Let us show that there are no other primes. u0 and u1 are non-prime by inspection. For n≥1, u2n+1=un+12−un2=(un+1−un)(un+1+un). By the inequality above, both factors are at least 2 and so u2n+1 is not prime. For n>1, u2n=un(2un+1−2011un). The first term is clearly greater than 1, and the second equals un+1−un−1≥un+1−un≥2.
Thus, u2=2011 is the only prime in the sequence.