Euler Problem 117

Using a combination of black square tiles and oblong tiles chosen from: red tiles measuring two units, green tiles measuring three units, and blue tiles measuring four units, it is possible to tile a row measuring five units in length in exactly fifteen different ways.

How many ways can a row measuring fifty units in length be tiled?


In [1]:
a,b,c,d = 0,0,0,1
for n in range(50):
    a, b, c, d = (b, c, d, a + b + c + d)
print(d)


100808458960497

In [ ]: