Number of distinct ways to tile a 2 X n rectangle with dominoes (solutions are identified if they are rotations or reflections of each other).

A060312

Number of distinct ways to tile a 2 X n rectangle with dominoes (solutions are identified if they are rotations or reflections of each other).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =4a(4) =5a(5) =9a(6) =12a(7) =21a(8) =30a(9) =51a(10) =76a(11) =127a(12) =195a(13) =322a(14) =504a(15) =826a(16) =1309a(17) =2135a(18) =3410a(19) =5545a(20) =8900a(21) =14445a(22) =23256a(23) =37701a(24) =60813a(25) =98514a(26) =159094a(27) =257608a(28) =416325a(29) =673933

External references