This is a task I had in discrete mathematics last year, that I never really managed to get the hang of..
Make a recurrence relation for the number of different bit strings with 2 1s with length n.
(Please explain the reasoning for arriving at the answer as well)