We want to tile a n 2 strip with unit size tiles that are either green, red or yellow, such that no two red tiles are adjacent. (Adjacent means here that they belong to the same or two consecutive columns, so even their corners cannot touch.) Here is an example of a correct tiling: Give a formula for the number of such tilings. Your solution must include a recurrence equation, with a full justification, and its step-by-step solution