What is the complexity of the below code? I could not not frame the recurrence leading to the code,it will be helpful if you guys please get me atleast the method to structure its recurrence:
Here it goes:

int f(n)
{
if(n<=1)
return 1;
else
for( i=n; i>1; i-- )
{
r=r + f( i / 3 );
}
return r;
}