Having a really hard time wrapping my head around how to approach this. written out the formula up to $b_5$ but not seeing a pattern at all, I've scoured my notes, google and so on. missing some critical piece of knowledge I can't seem find.
Appreciate any help.
The sequence $b_0,b_1,b_2$, ... is defined as follows:
$b_0 = 0$, $b_1 = 1/2$, and for integers $n \ge 2$, $b_n = \sqrt{b_{n-1}b_{n-2}} + \frac{3n}{2} - 1.$
Guess the formula for $b_n$ for all integers $n \ge 0.$
Prove By Induction that the guess is correct.
Hint: Compute the first few terms: $$ \begin{array}{rc} n & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\ b_n & 0 & 0.5 & 2 & 4.5 & 8 & 12.5 & 18 & 24.5 & 32 & 40.5 & 50 \\ 2b_n & 0 & 1 & 4 & 9 & 16 & 25 & 36 & 49 & 64 & 81 & 100 \\ \end{array} $$