Recursive sequences
Apply a recursive formula (including a Fibonacci-style two-term recurrence) to generate terms of a sequence. Unlimited questions, five difficulty levels, and a full worked solution every time — free.
Try one
Use the recursive definition to find t_4.
t1 = 7, tn = tn-1 · 2 (n ≥ 2)
Answer: 56
See one solved, step by step
Use the recursive definition to find t_6.
t1 = 6, tn = tn-1 · 2 (n ≥ 2)
📘 Worked solution
1t2 = t1 · 2 = 6 · 2 = 12Apply the recursive rule to the previous term.
2t3 = t2 · 2 = 12 · 2 = 24Apply the recursive rule to the previous term.
3t4 = t3 · 2 = 24 · 2 = 48Apply the recursive rule to the previous term.
4t5 = t4 · 2 = 48 · 2 = 96Apply the recursive rule to the previous term.
5t6 = t5 · 2 = 96 · 2 = 192Apply the recursive rule to the previous term.
Ready to master it?
Jump into unlimited practice — your Winny Score tracks you to 100. And if it won't click, a real tutor will make it click: first lesson free.
Start practicing