t(n+1) = t(n) + 6
t(1) = -14
Chat with our AI personalities
It look like a Fibonacci sequence seeded by t1 = 2 and t2 = 1. After that the recursive formula is simply tn+1 = tn-1 + tn.
10
(4*10+11+2*12+13+2*14)/10 = 11.6
The answer depends on what the explicit rule is!
140/10 = 14