Find an expression which yields the number of ways to split a 2 by N rectangle into two polyominoes. Rotations and reflections are NOT considered distinct.
For example, if N=1 there is only one way - two 1x1 squares.
If N=2 then there are two ways - one way is a 1x1 square with an "L" shape and two 2x1 rectangles as the other.
If N=3 then there are the 6 ways as depicted:
(In reply to
re: Table by Jer)
If for N=2 we could have a total of 3 then we have triangular all of the way.
I think therefore, because of the symmetry that arises from the square (2x2) that and the N=1 value need to be excluded from the definition as we often do as situations when a divisor in an expression may not be zero.
|
|
Posted by brianjn
on 2009-11-12 10:20:46 |
re(2): Table
