Once we determine the values of 'r' from the indicial equation, the next step is to find the recursion relationships. These relationships allow us to calculate all other coefficients in the power series solution, providing a pathway from one coefficient to another.
For each value of 'r', we develop separate recursion formulas. For the first solution \( r_1 = 0 \), the recursion relationship is:
- \[ a_n = -\frac{a_{n-1}}{(n+1)(n(2-n))} \quad \text{for} \quad n \geq 1 \]
This formula specifies how each coefficient \( a_n \) can be found based on its predecessor \( a_{n-1} \). The relationship includes factors involving 'n' that arise from simplifying collected terms in the differential equation.
Similarly, for the second solution \( r_2 = 1 \), the recursion relationship takes the form:
- \[ a_n = -\frac{(n+1)a_{n-1}}{n(n+2)(2-n)} \quad \text{for} \quad n \geq 1 \]
Here, each step builds upon the previous, ensuring a logical and systematic approach to constructing the series solutions.