teration

Given the sequence defined recursively as

b$1=1$

$$ bn $=$n$+($n $-1)?$b$,-|$ for every integer n $>1$

You will now use iteration to deduce a partial solution involving $\backslash$Sigma and $\backslash$Pi operators 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 $($and your grade will depend on it$).$Guess a non$-$recursive formula which describes the sequence. The formula should include $\backslash$Sigma and $\backslash$Pi operators and should be as compact as possible.

The pedagogical goal of this question is not to find an analytical solution for $,$ but to learn how to use iteration to notice patterns in sequences, and to write them correctly and succinctly using $\backslash$Sigma and $\backslash$Pi notation.

In order to do this, you must work from intermediate values instead of final values. Do distribute your operations to remove the parentheses in each term of the sequence, but do not calculate the results of additions, multiplications, and exponentiations, because if you do the pattern will disappear.b$1=1$

$$ bn $=$n$+($n $-1)?$b$,-|$ for every integer n $>1$