On a staircase, if Daniel can climb $$1$$, $$2$$, or $$3$$ steps at a time, then how many different ways can he reach the sixth step? 
Overseas Competition->Knowledge Point->Counting Modules->Permutations and Combinations->Combinations Overseas Competition->Knowledge Point->Combinatorics->Strategies and Operations->Inductive Recursion