Codeingbat:recursion-1:1(JAVA)

public int factorial(int n) {
  if(n == 1)
     return 1;
  else
     return n*factorial(n-1);
}

public int bunnyEars(int bunnies) {
if(bunnies ==0)
   return 0;
else
   return 2+bunnyEars(bunnies - 1);
 
}
public int fibonacci(int n) {
  if(n==1||n==0)
     return n;
  else
     return fibonacci(n-1)+fibonacci(n-2);
}
public int bunnyEars2(int bunnies) {
  if(bunnies==0)
     return 0;
  else{
     if(bunnies%2 ==0)
       return 3+bunnyEars2(bunnies-1);
     else
       return 2+bunnyEars2(bunnies-1);
  }
}

public int triangle(int rows) {
if(rows == 0)
   return 0;
else
   return rows+ triangle(rows -1);
 
}
public int sumDigits(int n) {
  if(n==0)
    return 0;
  else
    return n%10+sumDigits(n/10);
}
public int count7(int n) {
 if(n==7)
   return 1;
 else if(n<10)
   return 0;
 else
   return count7(n%10)+count7(n/10);
 
}
public int count8(int n) {
if(n<10){
   if(n==8)
      return 1;
   else
      return 0;}
else{
   if(n%100==88)
      return 2+count8(n/10);
   else if(n%10==8)
      return 1+count8(n/10);
   else
      return count8(n/10);}
}
public int powerN(int base, int n) {
  if(n==0)
     return 1;
  else
     return base*powerN(base,n-1);
}