While browsing around MSE I came across counting problems where some users recommend to use recursion to solve the problems. For example, in the following thread the user @lulu says that the problem at hand can be solved using recursion.
The other day someone suggested recursion as well when I was struggling with a fairly straightforward counting problem. As we haven't covered recursion yet (not sure we will), I was wondering where I can learn more about solving counting problems with recursion. Any particular websites, books or lecture notes? Thanks.
While not a textbook, Problem solving strategies by Arthur Engel has a chapter on enumerative combinatorics which has some good examples of solving problems using recursion. It also has a lot of interesting exercises.