In how many ways can we distribute k identical balls into n different boxes so that each box contains almost one ball and no two consecutive boxes are empty, $(2k+1\underset{\_}{>}n)$