Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (anonymous):

0, 2, 8, 26, 80, 242, 728, 2168, 6560, 19682 write a recursive formula or explicit formula?

OpenStudy (anonymous):

Hint: each of them increase by \[2 \times 3^{(n-1)}\]

OpenStudy (anonymous):

2168 should be 2186

OpenStudy (anonymous):

Thus the recursive formula will be\[A_{1}=0...and...A_{n}= 3A_{n-1}+2\]

OpenStudy (anonymous):

A_n = [3 ^ (n-1)] - 1 for 1 <= n < = 10

OpenStudy (anonymous):

TQ :)

OpenStudy (anonymous):

You're welcome! :)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!