Question

Burak received \[12\] rare stamps as a gift from his grandfather, so he decided to start a stamp collection. From the following week onward, Burak added \[4\] new stamps to his collection each week.
Let \[g(n)\] be the total number of stamps in Burak's collection in the \[n^\text{th}\] week of the collection.
\[g\] is a sequence. What kind of sequence is it?
Choose 1 answer:
A
Arithmetic sequence
B
Geometric sequence
Complete the recursive formula for \[g(n)\].
\[g(1)=\]
\[g(n)=g(n-1)\]

Answer 1

A — Arithmetic sequence.

g(1) = 12
g(n) = g(n−1) + 4 for n ≥ 2