Welcome to Bytelearn!

Let’s check out your problem:

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