The OEIS is supported by the many generous donors to the OEIS 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A172477 The number of ways to dissect an n X n square into polyominoes of size n. 6
 1, 2, 10, 117, 4006, 451206, 158753814, 187497290034, 706152947468301 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..9. Jiahua Chen, Aneesha Manne, Rebecca Mendum, Poonam Sahoo, Alicia Yang, Minority Voter Distributions and Partisan Gerrymandering, arXiv:1911.09792 [cs.CY], 2019. Johan de Ruiter, On Jigsaw Sudoku Puzzles and Related Topics, Bachelor Thesis, Leiden Institute of Advanced Computer Science, 2010. Christopher Donnay and Matthew Kahle, Asymptotics of Redistricting the n X n grid, arXiv:2311.13550 [math.CO], 2023. R. S. Harris, Counting Nonomino Tilings and Other Things of that Ilk, G4G9 Gift Exchange book, 2010. R. S. Harris, Counting Polyomino Tilings [From Bob Harris (me13013(AT)gmail.com), Mar 13 2010] EXAMPLE A 2 X 2 square can be covered by two dominoes by either positioning them vertically or horizontally. CROSSREFS Intersects with A167251, A167254, A167255, A167258. Sequence in context: A356514 A006121 A110951 * A265942 A120597 A322295 Adjacent sequences: A172474 A172475 A172476 * A172478 A172479 A172480 KEYWORD nonn,changed AUTHOR Johan de Ruiter, Feb 04 2010 EXTENSIONS a(9) from Bob Harris (me13013(AT)gmail.com), Mar 13 2010 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 December 4 21:08 EST 2023. Contains 367565 sequences. (Running on oeis4.)