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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100664 Number of inequivalent ways to dissect a square into n rectangles of equal perimeter. 1
1, 1, 2, 6, 16, 50, 177, 664, 2532, 9785 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Dissections differing only by rotations and/or reflections are not counted as distinct. - N. J. A. Sloane, Dec 06 2012

LINKS

Table of n, a(n) for n=1..10.

Johan Nilsson, Illustrations of terms up to a(6).

EXAMPLE

There are six ways to dissect a square into four rectangles of equal perimeter, so a(4)=6.

CROSSREFS

Cf. A108066.

Sequence in context: A013989 A002841 A136509 * A317094 A339844 A258797

Adjacent sequences:  A100661 A100662 A100663 * A100665 A100666 A100667

KEYWORD

hard,more,nonn

AUTHOR

Herman Beeksma and Hans Riesebos (hans.riesebos(AT)wanadoo.nl), Aug 04 2005

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 19:52 EDT 2021. Contains 343586 sequences. (Running on oeis4.)