Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 2 rectangle.

A361218

Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 2 rectangle.

Terms

    a(0) =1a(1) =4a(2) =11a(3) =29a(4) =94a(5) =263a(6) =968a(7) =3416a(8) =11520a(9) =41912a(10) =136972a(11) =481388a(12) =1743784a(13) =6275886a(14) =23615432a(15) =93819128a(16) =368019576a(17) =1367900808a(18) =5403282616a(19) =19831367476a(20) =76031433360a(21) =300581321056

External references