To understand recursion better, you must follow along via pen and paper and make trees. You must work backwards in essence and create definitions as you gather base truths. An example being for this function:
fibon(3) always equals fibbon(3), fibbon(2) always equals fibbon(2). This makes your life so much easier if you are using a recurse that may being up fibbon(x) multiple times.