Recursive Sample

public class JAVA {
    static int accNumber(int n){
       if (n==1)
           return 1;
        else
           return n + accNumber(n-1);
    }
    static long fib(int n){
       if  (n<=2)
           return n;
       else{
             return(fib(n-1)+fib(n-2));
       }
   }
    static long fact(int n){
        if (n==1)
            return 1;
        else
            return n*fact(n-1);
    }
    public static void main(String[] args){
       for (int i=1;i<=20;i++){
            System.out.println(i + ":");
            System.out.println(accNumber(i));
            System.out.println(fact(i));
            System.out.println(fib(i));
            System.out.println();
       }
    }
}