CodeRunBox
Compiler
Glossary
Example
Course
Python
JavaScript
C
C++
Java
R
Kotlin
Additional
Find the Statistical ModeWrite to a FileFormat Decimal Places
Data Frames
Convert a List to a DataframeCreate an Empty DataframeCombine Two Dataframe into OneChange Column Name of a DataframeExtract Columns From a DataframeDrop Columns in a DataframeReorder Columns in a DataframeSplit DataframeMerge Multiple DataframesDelete Rows From DataframeMake a List of Dataframes
Introduction
"Hello World" ProgramAdd Two VectorsFind Sum, Mean and Product of Vector in R ProgrammingTake Input From UserGenerate Random Number from Standard DistributionsSample from a PopulationFind Minimum and MaximumSort a Vector
Strings
Concatenate Two StringsFind the Length of a StringCheck if Characters are Present in a StringExtract n Characters From a StringReplace Characters in a StringCompare two StringsConvert Factors to CharactersTrim Leading and Trailing Whitespaces
Vectors
Concatenate a Vector of StringsCheck if a Vector Contains the Given ElementCount the Number of Elements in a VectorFind Index of an Element in a VectorAccess Values in a VectorAdd Leading Zeros to Vector
Decision and Loops
Find the Factorial of a NumberR Multiplication TableCheck Prime Numbercheck Armstrong NumberPrint the Fibonacci SequenceCheck for Leap YearCheck if a Number is Odd or Even in R ProgrammingCheck if a Number is Positive, Negative or ZeroFind the Sum of Natural Numbers
Functions
Convert Decimal into Binary using Recursion in RFind the Factorial of a Number Using RecursionFind the Factors of a NumberFibonacci Sequence Using Recursion in RFind H.C.F. or G.C.D.Find L.C.M.Make a Simple CalculatorSum of Natural Numbers Using Recursion

Python Program to Print the Fibonacci sequence

To understand this example, you should have the knowledge of the following Python programming topics:

A Fibonacci sequence is the integer sequence of 0, 1, 1, 2, 3, 5, 8…

The first two terms are 0 and 1. All other terms are obtained by adding the preceding two terms. This means to say the nth term is the sum of (n-1)th and (n-2)th term.

Source Code


              

# Program to display the Fibonacci sequence up to n-th term

nterms = int(input("How many terms? "))

# first two terms
n1, n2 = 0, 1
count = 0

# check if the number of terms is valid
if nterms <= 0:
   print("Please enter a positive integer")
# if there is only one term, return n1
elif nterms == 1:
   print("Fibonacci sequence upto",nterms,":")
   print(n1)
# generate fibonacci sequence
else:
   print("Fibonacci sequence:")
   while count < nterms:
       print(n1)
       nth = n1 + n2
       # update values
       n1 = n2
       n2 = nth
       count += 1

Output


              

How many terms? 7
Fibonacci sequence:
0
1
1
2
3
5
8

Here, we store the number of terms in nterms. We initialize the first term to 0 and the second term to 1.

If the number of terms is more than 2, we use a while loop to find the next term in the sequence by adding the preceding two terms. We then interchange the variables (update it) and continue on with the process.

You can also print the Fibonacci sequence using recursion.