The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 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
 1, 128, 55756, 31544384, 19415751782, 12300505521832, 7871769490695758, 5055501014135301068, 3250879178100782348462, 2091366508168264152856116, 1345636228678678520218159342, 865863320865232237151806089380, 557159535051149816106032278432958 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..100 Joshua Smith and Helena Verrill, On dividing rectangles into rectangles CROSSREFS Column m=8 of A116694. Sequence in context: A013996 A239648 A239404 * A323541 A330486 A016795 Adjacent sequences:  A220298 A220299 A220300 * A220302 A220303 A220304 KEYWORD nonn AUTHOR Alois P. Heinz, Dec 10 2012 STATUS approved

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

Last modified December 1 16:44 EST 2021. Contains 349430 sequences. (Running on oeis4.)