Answer :
The fibanocci sequence with the use of a for loop and do not use a recursion .
Program :
def fibonacci(num):
if num < 0:
print("-1")
elif num == 0:
return 0
elif num == 1:
return 1
else:
return fibonacci(num-1) + fibonacci(num-2)
if __name__ == '__main__':
start_number = int(input())
print(f'fibonacci({start_number}) is {fibonacci(start_number)}')
what is a Fibonacci sequence?
The Fibonacci series is a sequence of numbers (also known as Fibonacci numbers) in which each number is the sum of the two numbers before it, with the first two terms being '0' and '1'. The term '0' may have been omitted in earlier versions of the series. A Fibonacci series can thus be written as 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,... As a result, every term can be calculated by adding the two terms preceding it.
Thus the code return the fibanocci series
To know more on fibanocci follow this link:
https://brainly.com/question/29764204
#SPJ4