It is given the sequence {an}: a1=1, an+1=2an+n⋅(1+2n),n=1,2,3,…
Find the general term an.
Solution — click to reveal
Divide the recursion formula by 2n+1 throughout, we obtain 2n+1an+1=2nan+2n+1n+2n, that is, 2n+1an+1−2nan=2n+1n+2n. Then i=1∑n(2i+1ai+1−2iai)=i=1∑n2i+1i+i=1∑n2i,2n+1an+1−21a1=4n(n+1)+i=1∑n2i+1i,an+1=2n+1[4n(n+1)+2n1+21i=1∑n2ii]. Set Sn=∑i=1n2ii, then 2Sn=∑i=1n2i−1i, and Sn=2Sn−Sn=i=1∑n2i−1i−i=1∑n2ii=i=1∑n2i−1i−i=2∑n+12i−1i−1=21−11−2n+1−1n+1−1+i=2∑n(2i−1i−2i−1i−1)=1−2nn+i=2∑n2i−11=1−2nn+21[1−(21)n−1]=1−2nn+1−2n−11=2−2nn+2. Thus, an+1=[4n(n+1)+2n1+21(2−2nn+2)]=2n+1[23+4n(n+1)−2n+1n+2](n≥1). Consequently, an=2n−2(n2−n+6)−n−1(n≥2).
Final answer
a_n = 2^{n-2}(n^2 - n + 6) - n - 1 (n ≥ 2)
Techniques
Recurrence relationsTelescoping seriesSums and products