Codes Inc; Room #007

public static long count(int n) {
    return 3L << (n - 1);
}

public static long count(int n){
        return n != 1 ? 3 * (long)Math.pow(2, n-1) : 3;
    }

public static long count2(int n){
        if(n == 1)
            return 3;
        return 2*count2(n-1);
    }

public static int count(int n){
        return 3 + (n-1)*2;
    }