Kotlin Program to Calculate the Fibonacci Series

In this blog post, we will learn how to write a Kotlin program to calculate the Fibonacci Series.

The Fibonacci series is a famous sequence of numbers where each number is the sum of the two preceding ones. It starts with 0 and 1, and the subsequent numbers are obtained by adding the previous two numbers. In this blog post, we will explore a Kotlin program that efficiently calculates the Fibonacci series. We will walk through the program step by step, explaining the logic behind it.

Kotlin Program: Calculating the Fibonacci Series

To calculate the Fibonacci series in Kotlin, we can utilize a recursive approach. Let's dive into the code:
fun fibonacci(n: Int): Long {
    if (n <= 1) {
        return n.toLong()

    return fibonacci(n - 1) + fibonacci(n - 2)

fun main() {
    val terms = 10

    for (i in 0 until terms) {
        val fibonacciNumber = fibonacci(i)
        print("$fibonacciNumber ")


0 1 1 2 3 5 8 13 21 34 
The fibonacci() function takes an integer n as input and returns the corresponding Fibonacci number as a Long value. 

In the function, we have a base case: if n is less than or equal to 1, we return n as a Long value. 

For values of n greater than 1, we recursively call the fibonacci() function with n - 1 and n - 2 to obtain the two preceding Fibonacci numbers. 

We add these two preceding numbers to get the current Fibonacci number. 

In the main() function, we specify the number of terms we want to calculate (val terms = 10). We use a loop to iterate from 0 to terms - 1. Inside the loop, we call the fibonacci() function for each value of i and print the Fibonacci number to the console using print(). 


In this blog post, we have discussed a Kotlin program that efficiently calculates the Fibonacci series using a recursive approach. The Fibonacci series is a widely known mathematical sequence, and understanding this program equips you with the necessary skills to generate Fibonacci numbers in Kotlin. 

Feel free to explore and modify the code to suit your specific needs. The Fibonacci series has numerous applications in various domains, such as mathematics, algorithms, and dynamic programming. Happy coding!