undefined

Iteration #1 Given the sequence defined recursively as 2 = 1 Ant1 = n2 - 2n + 1 for every positive integer n You will now use iteration to deduce a partial solution for this sequence: . Give the first 6 terms of the sequence. Show and keep the intermediate expansions because they are more important than the final values for noticing a pattern. Guess a non-recursive formula which describes the sequence. The formula can include II, E, and the mod operator. The pedagogical goal in questions 3 and 4 is not to find an answer, but to learn how to use iteration to notice patterns in sequences, which is a more difficult skill. In order to do this, you must work from intermediate values instead of final values. The best way to approach this particular question is to start by not adding any numbers when you work with each term of the sequence. Do take care of the parentheses that are created each time you do -an, but refrain from multiplying everything and adding everything, because if you do, the pattern will disappear