Which recursive formula can be used to generate the sequence shown, where f(1) = 5 and n > 1? 5,–1, –7, –13, –19, ...

f(n + 1) = f(n) + 6
f(n) = f(n +1) – 6
f(n +1) = f(n) – 6
f(n +1) = –6f(n

i honestly dont know

there is only one way to arrange all the eight relative to each other because they are not distinct. we have

now there are nine places to place an (and not more than one in one place).   because we have four symbols, we need to choose four of these nine places to insert an . order does not matter because the are not distinct.

thus there are 1 · c(9,4) ways, or, if we calculate it,

thus there are 126 ways to form such "words."