Ask your own question, for FREE!
Mathematics 17 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!
Latest Questions
Mari103: How to pop out like a Jacc In the box
36 minutes ago 0 Replies 0 Medals
Breathless: Spooky witch but cute
7 hours ago 3 Replies 0 Medals
Arriyanalol: help
7 hours ago 10 Replies 2 Medals
Arriyanalol: @tinydinoUwU stop trying to find a argument u blad lil boy
1 day ago 5 Replies 4 Medals
Jaded012023: Please tell me what you all think of this song
10 hours ago 6 Replies 1 Medal
Arriyanalol: bro how
10 hours ago 2 Replies 3 Medals
Arriyanalol: cant wait for the new bluey movie in 2027
1 day ago 12 Replies 2 Medals
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!