The correct option is C an+1an
Denoting bn=an+1−an, we observe that the given recursive equation becomes bn=bn+1+2,
Thus,
(bn)n≥0,
is an arithmetic sequence and hence bn=b0+2n=2n.
Writing ak+1−ak=2(k−1) for k=1,2,...,n−1
and adding up yield an=n2−n+1, for all n≥0.
Now,an elementary computation shows that an2+1=(n2+12)−(n2+1)+1=(n2+n+1)(n2−n+1)=an+1an,
as desired.