TinyChan

I think this would be the recursive code for it. It might be off by one, I don’t really feel like testing it, but:

function recurse(f, x, n, i = 0){
    if ( i < n ) {
        return f(recurse(f, x, n, i + 1));
    }
    return x;
}