Java Fibonacci Sequence

Java Fibonacci Sequence.java

	/**
	 * Calculates the next fibonacci sequence.
	 * 
	 * To properly implement a Fibonacci sequence, 
	 * we need to know the Mathematical formula first, and that is: 
	 *      
	 *       F<sub>n</sub> = F<sub>n-1</sub> + F<sub>n-2</sub>
	 * 
	 * The above formula basically reads as this: 
	 * 		The next sequence (Fn) is the sum of the 
	 * 		2 previous sequences (F<sub>n-1</sub> + F<sub>n-2</sub>)       
	 *       
	 * @param index of the Fibonacci sequence
	 * @author Jon Bonso
	 * @return
	 */
	static int recursiveFibo(int num) {
		
	    if (num <= 1) return num;
		
	    // Implementation of the 
	    // F<sub>n</sub> = F<sub>n-1</sub> + F<sub>n-2</sub>
            else return recursiveFibo(num-1) + recursiveFibo(num-2);
	}
	
	/**
	 * Generate the Fibonacci Sequence
   * @author Jon Bonso
	 * @param numOfSequences
	 */
	static void generateFibonacciSequence(int numOfSequences) {
		for(int i=0; i < numOfSequences; i++) {
			System.out.println(recursiveFibo(i));
		}
	}
	
	
  public static void main( String[] args ){
			generateFibonacciSequence(10);
  }

Note: here's the Fibonacci sequence formula:

F_n = F_n-1 + F_n-2