Algebra and Trigonometry 10th Edition

Published by Cengage Learning
ISBN 10: 9781337271172
ISBN 13: 978-1-33727-117-2

Chapter 11 - Review Exercises - Page 840: 6


$a_1=-1$, $a_n=a_{n-1}+(2n-1)$.

Work Step by Step

As we can see the difference between the successive terms of the sequence is the successive odd numbers (starting at $3$ for the second term). Thus a recursive formula is: $a_1=-1$, $a_n=a_{n-1}+(2n-1)$.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.