Question

The formula for the nth Tetranacci number ?? is defined as follows: ?0 = 0 ?1 = 1 ?2 = 1 ?3 = 2 ?? = ??−1 + ??−2 + ??−3 + ??−4 Your task is to implement a recursive function which accepts an integer n (you may assume that n >= 0), and computes the n-th Tetranacci number (don’t worry about efficiency, only about making the definition as simple as possible).

Answer 1

`Hey,

Note: If you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

#include <stdio.h>
int tera(int n)
{
if(n==0)
return 0;
if(n==1)
return 1;
if(n==2)
return 1;
if(n==3)
return 2;
return tera(n-1)+tera(n-2)+tera(n-3)+tera(n-4);
}
int main()
{
printf("%d\n",tera(8));

return 0;
}

Kindly revert for any queries

Thanks.