WeBWorK Standalone Renderer

Find a recursive definition for the sequence 7, 11, 15, 19, 23,... Assume the first term in the sequence is indexed by $n = 1$ , and enter $f_{n-1}$ as $f(n-1)$ .

$f(1) =$ and $f(n)$ = for $n > 1$ .
Find a closed formula for the sequence 7, 11, 15, 19, 23,... Assume the first term in the sequence is indexed by $n = 1$ .

$f(n) =$

In order to get credit for this problem all answers must be correct.