Number of sets of integer-sided rectangular pieces that can tile a 2 X n rectangle.

A360631

Number of sets of integer-sided rectangular pieces that can tile a 2 X n rectangle.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =10a(4) =22a(5) =44a(6) =91a(7) =172a(8) =326a(9) =595a(10) =1066a(11) =1849a(12) =3204a(13) =5365a(14) =8921a(15) =14581a(16) =23558a(17) =37440a(18) =59127a(19) =91957a(20) =142060a(21) =217015a(22) =328939a(23) =493917a(24) =737249a(25) =1090432a(26) =1603439a(27) =2341094a(28) =3398313a(29) =4900740

External references