Python Program to Print the Fibonacci sequenceIn this tutorial, we will discuss how the user can print the Fibonacci sequence of numbers in Python. Fibonacci sequence: Fibonacci sequence specifies a series of numbers where the next number is found by adding up the two numbers just before it. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, … and so on. In mathematical terms, the sequence "F_{n}" of the Fibonacci sequence of numbers is defined by the recurrence relation: F_{n}= F_{n_1}+ F_{n_2} Where seed values are: F_{0}=0 and F_{1}=1 Method: 1  By using a while loopWe will use a while loop for printing the sequence of the Fibonacci sequence. Step 1: Input the number of values we want to generate the Fibonacci sequence Step 2: Initialize the count = 0, n_1 = 0 and n_2 = 1. Step 3: If the n_terms <= 0 Step 4: print "error" as it is not a valid number for series Step 5: if n_terms = 1, it will print n_1 value. Step 6: while count < n_terms Step 7: print (n_1) Step 8: nth = n_1 + n_2 Step9: we will update the variable, n_1 = n_2, n_2 = nth and so on, up to the required term. Example: Output: How many terms the user wants to print? 13 The Fibonacci sequence of the numbers is: 0 1 1 2 3 5 8 13 21 34 55 89 144 Explanation: In the above code, we have stored the terms in n_terms. We have initialized the first term as "0" and the second term as "1". If the number of terms is more than 2, we will use the while loop for finding the next term in the Fibonacci sequence by adding the previous two terms. We will then update the variable by interchanging them, and it will continue with the process up to the number of terms the user wants to print. ConclusionIn this tutorial, we have discussed how the user can print the number of fibonacci sequence of numbers to the nth terms.
Next TopicPython Check Armstrong Number
