The discussion centers on an issue with Mathematica's RSolve function, where a user expects the output for a recurrence relation to simplify to just Fibonacci[n] but instead receives a more complex expression involving both Fibonacci and LucasL sequences. The problem arises when the initial conditions are set to a[1] == 1 and a[2] == 1, leading to unexpected results. Users suggest that modifying the initial conditions or using the Clear function may resolve the issue, as it appears to affect the evaluation of the function. The conversation highlights potential bugs or syntax issues in Mathematica 6, with some users achieving the desired output by adjusting their approach. Overall, the thread reflects the complexities of using RSolve in Mathematica and the importance of initial conditions in obtaining correct results.