Pip is climbing up a staircase with $$9$$ steps. If Pip is climbing either $$1$$ or $$4$$ steps up per move, how many different ways can he climb the staircase? 
Overseas Competition->Knowledge Point->Combinatorics->Strategies and Operations->Inductive Recursion