Which recursive formula can be used to generate the sequence below, where f(1) = 3 and n ≥ 1?3, –6, 12, –24, 48, …

Each term is obtained by multiplying the previous term by −2: 3 × (−2) = −6, −6 × (−2) = 12, and 12 × (−2) = −24. Therefore the recursive rule is f(n + 1) = −2f(n), which is choice C.

AI-written and checked against the verified answer.