1003107304

Level: 
Project ID: 
1003107304
Accepted: 
1
Clonable: 
0
Easy: 
1
We are given a sequence (an)n=1 defined recursively by: a1=0; an+1=2an, nN. Find the nth term of this sequence.
an=1+(1)n, nN
an=1+(1)n+1, nN
an=1+(1)n1, nN
an=11n, nN