For a combinatorial interpretation: suppose you have $n$ distinguishable eggs, and you want to paint some of them red, some of them blue, and leave some of them unpainted. Show that both sides of your desired equation count the number of ways to do this.
For a combinatorial interpretation: suppose you have $n$ distinguishable eggs, and you want to paint some of them red, some of them blue, and leave some of them unpainted. Show that both sides of your desired equation count the number of ways to do this.