login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A333495 Number of ways of dividing a 2n X n rectangle into integer-sided rectangles. 2

%I #10 Mar 16 2023 13:45:16

%S 1,2,148,314662,19415751782,34223109012944482,

%T 1709004742525016740261850,2407826816243421894252785348151226,

%U 95524923938130486476975763614521056527129262,106619635380815059627115813538573777241948002538356771858,3346744054257695722669927876858961813239867346217968957293126431564898

%N Number of ways of dividing a 2n X n rectangle into integer-sided rectangles.

%H David A. Klarner and Spyros S. Magliveras, <a href="https://doi.org/10.1016/S0195-6698(88)80062-3">The number of tilings of a block with blocks</a>, European Journal of Combinatorics 9 (1988), 317-330.

%H Joshua Smith and Helena Verrill, <a href="/A116694/a116694.pdf">On dividing rectangles into rectangles</a>

%F a(n) = A116694(2n,n) = A333476(2n,n).

%Y Cf. A116694, A333476.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Mar 24 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 1 06:23 EDT 2024. Contains 375575 sequences. (Running on oeis4.)