Thread: python - Fibonacci Sequence

Hi,

Im very confused about this question concerning the Fibonacci sequence:


Implement an iterative Python function to generate numbers in the Fibonacci sequence:
fib(0) = 1
fib(1) = 1
fib(n) = fib(n − 1) + fib(n − 2)

Any help would be greatly appreciated!

Originally Posted by *skywalker*

Implement an iterative Python function to generate numbers in the Fibonacci sequence:
fib(0) = 1
fib(1) = 1
fib(n) = fib(n − 1) + fib(n − 2)

Any help would be greatly appreciated!

n = ???
a,b,c = 0,1,1
while c<n:
a,b,c=b,a+b,c+1
print b

This will display the nth term of the Fibonacci sequence and it's iteratve but it's not a function.

You could ....put them in a list.....display them all...or whatever you want to do..

By the way I can't read word documents.

See here:

Recursive fibonacci function. : Function Recursive«Function«Python