Ask your own question, for FREE!
Mathematics 11 Online
OpenStudy (anonymous):

Find a recursive rule for the sequence 1, 4, 9, 22, …

OpenStudy (anonymous):

f1 = 1 f2 = 4 f(n) = (n-2) + (n-1) for n > 2

OpenStudy (anonymous):

Finding the sequence is the hardest thing, from there just think, how did they do the sequence?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!