for those of you learning JS etc, there are no unity tuts on unity recursive, so here are recursive functions and links for learning:

Factorial Complete:

var number = 5.5;
function factorial(n) : int
{
// If the number is not an integer, round it down.
n = Mathf.Floor(n);
// The number must be equal to or bigger than zero
if (n < 0)
{
return (0);
}
if ((n == 0) || (n == 1))
{ // If the number is 0 or 1, its factorial is 1.
return (1);
}
else
{ // Make a recursive call
return (n * factorial(n - 1));
}
}
print(factorial(number));

Fibonacci in unity:

function Fibo(n) : int
{
if((n==1)||(n==2)) return 1;
else return Fibo(n-1) + Fibo(n-2);
}

print(Fibo(8));

good page for JS recursion, in the end i think they do a JS maze generator!