I am missing something for my combinatorial proof. So far, I am able to show how to get 2*a_(n-1), and that we have to add 1 to that because we didn't take into account just inviting the nth friend, but I don't see where the remaining missing 1 is. Right now, my proof is stuck at 2*a_(n-1) + 1.