Question Number 55823 by 121194 last updated on 04/Mar/19
$${let} \\ $$$${f}\left({n},{m}\right)=\begin{cases}{\mathrm{1}}&{{n}\:=\:\mathrm{1}}\\{{m}+\mathrm{1}}&{{n}\:=\:\mathrm{2}}\\{\underset{{i}=\mathrm{0}} {\overset{{m}} {\sum}}{f}\left({n}−\mathrm{1},{i}\right)}&{{n}\:>\:\mathrm{2}}\end{cases} \\ $$$${a}.\mathrm{compute}\:{f}\left(\mathrm{3},\mathrm{4}\right) \\ $$$${b}.\mathrm{find}\:\mathrm{a}\:\mathrm{function}\:\mathrm{tha}\:\mathrm{satisfies}\:\mathrm{above}\:\mathrm{recursion}. \\ $$