Python Function for Fibonacci Sequence
Description
This code demonstrates a recursive Python function to generate the Fibonacci sequence. It efficiently calculates Fibonacci numbers up to a specified limit.
Code Snippet
def fibonacci(n):
"""Recursive function to generate Fibonacci sequence up to n."""
if n <= 0:
return []
elif n == 1:
return [0]
else:
list_fib = fibonacci(n-1)
next_fib = list_fib[-1] + list_fib[-2] if len(list_fib) > 1 else 1
list_fib.append(next_fib)
return list_fib
# Get input from the user
num_terms = int(input("Enter the number of terms: "))
# Generate and print the Fibonacci sequence
print(fibonacci(num_terms))