I'm not sure if this is right

[dagreat45]

I need some big time help with this Code please help?
Write a recursive C++ Function unsigned long trib(int n) which returns the nth (1=<n=<38) tribonacci according to the recursive formula
T1 =T2 =T3=1
Tn=Tn-1+Tn-2+Tn-3


if (n<=3)
{
return 1;
}
else
{
return trib(n-1)+trib(n-2)+trib(n-3)
}

[vlad from moscow]

tribonacci is it the name of some mathematicion?:)

unsigned long trib( unsigned int n )
{
   return ( ( n < 3 ) ? 1 : trib( n - 1 ) + trib( n - 2 ) + trib( n - 3 ) );
}

I am assuming that the numbers start from T0 that is T0 = 1, T1 = 1, and T2 = 1.