A bag contains red and blue tiles. Each tile has a number from the set \{-1, 0, 1\} written on it. I want to arrange 7 of these tiles in a row, so that the numbers on any three consecutive tiles sum to 3. In how many ways can this be done, assuming that there are an unlimited number of tiles for any color and number combination?
For three consecutive tiles with numbers ai,ai+1,ai+2, we require ai+ai+1+ai+2=3.
Since each number is in {-1, 0, 1}, the maximum sum is 1+1+1=3, so ai=ai+1=ai+2=1.
So, all 7 tiles must have number 1 to satisfy for all consecutive triples.
Each of the 7 tiles, all numbered 1, can be red or blue, giving 27=128 color assignments.
So there are 128 possible arrangements.
mercurym999