Maximum number of ways in which a set of integer-sided squares can tile an n X 4 rectangle.

A362145

Maximum number of ways in which a set of integer-sided squares can tile an n X 4 rectangle.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =6a(4) =16a(5) =37a(6) =105a(7) =250a(8) =726a(9) =1824a(10) =5148a(11) =13406a(12) =37150a(13) =99246a(14) =271533a(15) =739222a(16) =2003686a(17) =5534352a(18) =14894898a(19) =41614480a(20) =112569696a(21) =329633400a(22) =939351720a(23) =2713971172a(24) =7790778688a(25) =22262413872a(26) =64295778000a(27) =182043931368a(28) =528451813656

External references