Assume that you've an unlimited supply of red, white, blue, green, and gold poker chips, which are indistinguishable except for color. Write a recurrence relation and initial conditions for the number sn of ways to stack n chips with no two consecutive red chips.