---
title: "Fibonacci series Using Recursion"  
description: "In this blog I am provide you the complete code for generating Fibonacci series using java.import java.util.Scanner;  import java.io.*;   public clas"  
author: "Vijay Shukla"  
published: 2013-10-04  
updated: 2014-09-18  
canonical: https://www.mindstick.com/blog/597/fibonacci-series-using-recursion  
category: "java"  
tags: ["java"]  
reading_time: 2 minutes  

---

# Fibonacci series Using Recursion

In this [blog](https://www.mindstick.com/articles/12705/myths-and-misconception-about-blog) I am provide you the complete [code](https://yourviews.mindstick.com/view/85458/alan-turing-the-mastermind-behind-cracking-the-enigma-code-during-world-war-ii) for generating [Fibonacci series](https://www.mindstick.com/forum/55172/fibonacci-series-and-addition-two-of-matrices-program-is-written-in-java) using [java](https://www.mindstick.com/articles/12214/web-development-company-in-india-laid-on-the-foundation-of-concrete-java-programming).

```
import java.util.Scanner;import java.io.*;
public class FibonacciCalculator {    public static void main(String args[]) {
       //input to print Fibonacci series upto how many numbers        System.out.println("Enter number upto which Fibonacci series to print: ");
        int number = new Scanner(System.in).nextInt();
        System.out.println("Fibonacci series upto " + number +" numbers : ");
        //printing Fibonacci series upto number
        for(int i=1; i<=number; i++){            System.out.print(fibonacci2(i) +" ");
        }
    }
    /*     * Java program for Fibonacci number using recursion.     * This program uses tail recursion to calculate Fibonacci number for a given number
     * @return Fibonacci number     */
    public static int fibonacci(int number){
        if(number == 1 || number == 2){            return 1;        }
     return fibonacci(number-1) + fibonacci(number -2); //tail recursion
    }
/* * Java program to calculate Fibonacci number using loop or Iteration.     * @return Fibonacci number     */
    public static int fibonacci2(int number){        if(number == 1 || number == 2){            return 1;
        }
        int fibo1=1, fibo2=1, fibonacci=1;        for(int i= 3; i<= number; i++){            fibonacci = fibo1 + fibo2; //Fibonacci number is sum of previous two Fibonacci number
            fibo1 = fibo2;            fibo2 = fibonacci;        }        return fibonacci; //Fibonacci number
    }
}
```

##### Output: -

![Fibonacci series Using Recursion](https://www.mindstick.com/blogs/133c8ebd-11ba-4dda-9374-8343e5488781/images/37e4f38a-fe16-409f-8c57-aa5d1f1b32b2.png)

---

Original Source: https://www.mindstick.com/blog/597/fibonacci-series-using-recursion

Copyright © MindStick Software Pvt. Ltd. This Markdown version is provided for developers, AI systems, and offline reading.