Fibonacci Number Generation in Java

This simple example explains how to write a Java program to print the fibonacci numbers. Fibonacci numbers are sequence of numbers where one number is the sum of preceding two numbers. An example for the fibonacci is “0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …”. If you look at the series, every number is derived by adding the previous two numbers. Look at the below example to write for loop logic for printing the fibonacci numbers.

[code lang=”java”]
package javabeat.net.util;

public class FibonacciNumberExample {
public static void main(String[] args) {
int maxValue = 20;
long[] seriesArray = new long[maxValue];
seriesArray[0] = 0;
seriesArray[1] = 1;
// calculate the Fibonacci numbers and store them in array
for (int i = 2; i < maxValue; i++) {
seriesArray[i] = seriesArray[i – 1] + seriesArray[i – 2];
}
System.out.println("Fibonacci Series For " + maxValue);
for (int i = 0; i < maxValue; i++) {
System.out.print(seriesArray[i] + " ");
}
}
}

[/code]

Output

[code]
Fibonacci Series For 20
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181
[/code]