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!)
A220301 Number of ways to cut an 8 X n rectangle into rectangles with integer sides. 3

%I #17 Mar 16 2023 13:38:57

%S 1,128,55756,31544384,19415751782,12300505521832,7871769490695758,

%T 5055501014135301068,3250879178100782348462,2091366508168264152856116,

%U 1345636228678678520218159342,865863320865232237151806089380,557159535051149816106032278432958

%N Number of ways to cut an 8 X n rectangle into rectangles with integer sides.

%H Alois P. Heinz, <a href="/A220301/b220301.txt">Table of n, a(n) for n = 0..100</a>

%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>

%Y Column m=8 of A116694.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Dec 10 2012

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 April 23 12:55 EDT 2024. Contains 371913 sequences. (Running on oeis4.)