Welcome to Bytelearn!

Let’s check out your problem:

Which recursive formula can be used to define this sequence for $n > 1$?$\newline$$1, 4, 7, 10, 13, 16, \ldots$$\newline$Choices:$\newline$(A) $a_n = 4a_{n-1}$$\newline$(B) $a_n = a_{n-1} + 3$$\newline$(C) $a_n = a_{n-1} + a_{n-2} - 3$$\newline$(D) $a_n = a_{n-1} - 3$