coing c help

how would I perform the exact same thing as the test function without using any recursion?

unsigned long test(unsigned long n){ if(n == 0) { return 1; } else if(n == 1) { return 2; } else{ | return (2*test(n-2) + test(n-1) + n + 2); } } 1 int main( void ) { printf("%lu ", test(10)); }