How can you write a fibonocci sequence in python?

Answer 1

A fibonocci sequence is a sequence where each term is equal to the sum of the previous two terms.

1, 1, 2, 3, 5, 8, 13, 21, etc

There are two main ways to do this with Python. The way explained here is through a loop or iteration. The other way would be to use recursion (a function that calls itself).

Note that anything following # is a comment and not part of the code.

Also note that the semicolons are NOT required.

top = raw_input("How high should I go?"); #prompt the user for the stopping point

num1, num2, num3 = 0, 0, 1; #set the num1, num2, and num3 variables equal to 0, 0, and 1 respectively

top = int(top); #top was initially a string variable, this converts it to an integer so we can compare it to our current term

print 1; #print the first 1 in the series

while num3 < top: #execute the indented code while num3 is less than top (our stopping point)

num1 = num2; #set num1 equal to num2 (this is 2 terms ago)

num2 = num3; #set num2 equal to num3 (this is the last term)

num3 = num1 + num2; #calculate the new term for num3

print num3; #display the new term