What is the recurrence relation of the following recursive function

int fun(int N) { if (N <= 1) { return (N+1)*(N+1); } int ans = 0; for (int i = 0; i < N: i++) { ans += fun(N-1); } return ans; }