Chapter 5.4, Problem 32E

ise a recursive algorithm to find the nth term of the sequence defined by $a_0=1,a_1=2,a_2=3,$and $a_n=a_{n-1}+a_{n-2}+a_{n-3}$,for $n=3,4,5,\mathrm{...}$