login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

The number of combinatorially distinct tilings of a square by n rectangles, regarding rotations and reflections as distinct.
0

%I #6 Aug 08 2021 21:59:42

%S 1,2,6,25,128,758,5014,36194,280433,2303918,19885534,179028087,

%T 1671644720,16114138846,159761516110,1623972412726,16880442523007,

%U 179026930243822,1933537655138482,21231023519199575,236674460790503286,2675162663681345170,30625903703241927542

%N The number of combinatorially distinct tilings of a square by n rectangles, regarding rotations and reflections as distinct.

%H Jim Conant and Tim Michaels, <a href="https://arxiv.org/abs/1204.5734">On the number of tilings of a square by rectangles</a>, Ann. Comb. 18 (2014) 21-34.

%K nonn

%O 1,2

%A James Conant (jconant(AT)math.utk.edu), Nov 01 2010