The question is this:
In how many partitions of $\{1,2,\ldots,n\}$ into three disjoint sets, $A$, $B$, and $C$, are there no two consecutive numbers in the set $A$?
thanks!
The question is this:
In how many partitions of $\{1,2,\ldots,n\}$ into three disjoint sets, $A$, $B$, and $C$, are there no two consecutive numbers in the set $A$?
thanks!
Number of ways of selecting $k$ numbers from $1,2,\dots,n$ such that no two are consecutive is
$\displaystyle \binom{n-k+1}{k}$, for instance see my answer here: Consecutive birthdays probability
Once you do that, count the number of partitions of the remaining into $B$ and $C$.
Which is given by $2S(n-k,2) + 2$ where $S(a,b)$ are the Stirling numbers of the second kind (for and explanation see the answer linked above).
Now I guess your answer is
$$\sum_{k=0}^{n} \binom{n-k+1}{k} (2S(n-k,2) + 2)$$
(Note: I haven't tried to confirm it, I leave that to you)
Hope that helps.