01: import java.util.Scanner;
02: 
03: /**
04:    This program computes Fibonacci numbers using a recursive
05:    method.
06: */ 
07: public class FibTester
08: {  
09:    public static void main(String[] args)
10:    {  
11:       Scanner in = new Scanner(System.in);
12:       System.out.print("Enter n: ");
13:       int n = in.nextInt();
14: 
15:       for (int i = 1; i <= n; i++)
16:       {
17:          long f = fib(i);
18:          System.out.println("fib(" + i + ") = " + f);
19:       }
20:    }
21: 
22:    /**
23:       Computes a Fibonacci number.
24:       @param n an integer
25:       @return the nth Fibonacci number
26:    */
27:    public static long fib(int n)
28:    {  
29:       if (n <= 2) return 1;
30:       else return fib(n - 1) + fib(n - 2);
31:    }
32: }