This is a classic combinatorics problem: number of ways to place 3 non-adjacent 1s in 8 positions.