login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049021 Number of topologically distinct ways to dissect a rectangle into n rectangles. 0
1, 1, 2, 7, 23, 116, 683, 4866 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

REFERENCES

W. J. Mitchell, J. P Steadman and R. S Liggett, Synthesis and optimization of small rectangular floor plans, Environment and Planning B, 1976 vol. 3.

E. J. Sauda, Dissection generating algorithm (University of Louisiana), 1976.

J. P. Steadman, Architectural Morphology, Pion Limited, London 1983, ISBN 0 85086 08605.

LINKS

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

CROSSREFS

Cf. A056814.

Sequence in context: A038119 A006986 A000903 * A002494 A032264 A139522

Adjacent sequences:  A049018 A049019 A049020 * A049022 A049023 A049024

KEYWORD

nonn,nice

AUTHOR

Stuart E Anderson

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 January 16 13:43 EST 2019. Contains 319193 sequences. (Running on oeis4.)