Stars and bars problem with the constraint that there has to be at least one bar between every star. Do we have formula for calculating the number of different cases?
closed as unclear what you're asking by user21820, Jyrki Lahtonen, Brian Borchers, MR_BD, Daniel Sep 8 '18 at 22:25
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
You can look up "stars and bars" construction to find the number of positive integer solutions for a sum of $n$ positive integers to equal a target sum $S$. But if some numbers have to be at least $k$, then you can just subtract $k-1$ from each such number and subtract $k-1$ from the sum $S$ for each such number, and then you've reduced to the original stars and bars problem.
It is pretty easy but I will just post it: Consider every star (except the last one) and the bar after it as one star (since the bar after the star is compulsory). Then we simplified our problem into a normal stars and bars one. Can be generalized if every star is followed by at least n bars.