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 6 of these tiles in a row, so that the numbers on any three consecutive tiles sum to 0. In how many ways can this be done, assuming that there are an unlimited number of tiles for any color and number combination?
