Fibonacci Sequence Using Recursion

In this code:
The fibonacci function takes an integer n as input.
The base case checks if n is 0 or 1, in which case the function returns n.
If n is greater than 1, the function recursively calls itself with n-1 and n-2 and sums the results.
You can modify the range in the list comprehension to generate a different number of Fibonacci numbers. Keep in mind that the recursive approach might become inefficient for large n due to redundant calculations; in such cases, dynamic programming or iterative methods are often preferred.