login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A163437
Number of different fixed (possibly) disconnected polyominoes (of any area) bounded tightly by an n X n square.
5
1, 7, 322, 51472, 29671936, 64588152832, 545697103347712, 18161310923858378752, 2399054119350722118025216, 1262710910458264839283982467072, 2653270028014955753823799266500411392
OFFSET
1,2
LINKS
FORMULA
a(n) = 2^(n^2) - 4*2^((n-1)*n) + 4*2^((n-1)^2) + 2*2^((n-2)*n) - 4*2^((n-2)*(n-1)) + 2^((n-2)^2).
EXAMPLE
a(2)=7: 2 rotations of the strictly disconnected domino consisting of two squares connected at a vertex, 4 rotations of the L tromino, and the square tetromino.
MATHEMATICA
Table[2^(n^2) - 4*2^((n - 1)*n) + 4*2^((n - 1)^2) + 2*2^((n - 2)*n) -
4*2^((n - 2)*(n - 1)) + 2^((n - 2)^2), {n, 1, 25}] (* G. C. Greubel, Dec 23 2016 *)
CROSSREFS
Cf. A162677 (bound not necessarily tight), A163433 (fixed disconnected trominoes), A163434 (fixed disconnected tetrominoes), A163435 (fixed disconnected pentominoes), A163436 (fixed disconnected n-ominoes).
Sequence in context: A244851 A082160 A220278 * A109059 A002000 A374418
KEYWORD
nonn
AUTHOR
David Bevan, Jul 28 2009
STATUS
approved