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

Terms

a(0) =1a(1) =1a(2) =2a(3) =4a(4) =6a(5) =12a(6) =24a(7) =40a(8) =80a(9) =160a(10) =280a(11) =560a(12) =1120a(13) =2240a(14) =4480a(15) =10080a(16) =20160a(17) =40320a(18) =88704a(19) =177408a(20) =354816a(21) =768768a(22) =1537536a(23) =3075072a(24) =6589440a(25) =13178880a(26) =26357760a(27) =56010240a(28) =112020480a(29) =224040960