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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182275 Number of ways of dividing an n X n square into rectangles of integer side lengths. 11
 1, 1, 8, 322, 70878, 84231996, 535236230270, 18100579400986674, 3250879178100782348462, 3097923464622249063718465240, 15657867573050419014814618149422562, 419678195343896524683571751908598967042082, 59647666241586874002530830848160043213559146735474 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Table of n, a(n) for n=0..12. David A. Klarner and Spyros S. Magliveras, The number of tilings of a block with blocks, European Journal of Combinatorics 9 (1988), 317-330. Joshua Smith and Helena Verrill, On dividing rectangles into rectangles FORMULA a(n) = A116694(n,n) for n > 0. EXAMPLE For n=2 the a(2) = 8 ways to divide are: ._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | | | | | |_ _| | |_| |_| | |_ _| |_|_| |_|_| |_ _| |_|_| |_ _| |_|_| |_|_| |_|_| |_ _| |_|_| CROSSREFS Main diagonal of A116694 and of A333476. Cf. A034999. Sequence in context: A308615 A041769 A209277 * A171248 A344094 A264053 Adjacent sequences: A182272 A182273 A182274 * A182276 A182277 A182278 KEYWORD nonn AUTHOR Matthew C. Russell, Apr 23 2012 EXTENSIONS a(11)-a(12) from Steve Butler, Mar 14 2014 STATUS approved

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.

Last modified November 30 19:18 EST 2023. Contains 367462 sequences. (Running on oeis4.)