Answer:
2, 4, 8, 16, 32
Explanation:
b(n) = 2b(n - 1) is a recursive formula which allows any term in a sequence b(n) to be found from the preceding term b(n - 1)
given b(1) = 2 , then
b(2) = 2b(2 - 1) = 2b(1) = 2 × 2 = 4
b(3) = 2b(3 - 1) = 2b(2) = 2 × 4 = 8
b(4) = 2b(4 - 1) = 2b(3) = 2 × 8 = 16
b(5) = 2b(5 - 1) = 2 b(4) = 2 × 16 = 32
the first 5 terms in the sequence are 2, 4, 8, 16, 32