|
| |
|
|
A163436
|
|
Number of different fixed (possibly) disconnected n-ominoes bounded tightly by an n*n square
|
|
1
| |
|
|
1, 2, 22, 425, 11550, 403252, 17164532, 860938920, 49684113582, 3240906864140, 235707022877304, 18906047682170948, 1657638292334575486, 157698852357527675040, 16177213677228994535040
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| a(n)=binomial(n^2,n)-4*binomial((n-1)*n,n)+4*binomial((n-1)^2,n)+2*binomial((n-2)*n,n)-4*binomial((n-2)*(n-1),n)+binomial((n-2)^2,n), n>1
|
|
|
EXAMPLE
| a(2)=2: the two rotations of the strictly disconnected domino consisting of two squares connected at a vertex
|
|
|
CROSSREFS
| Cf. A162676, A163437
Sequence in context: A138463 A007842 A201511 * A084949 A137076 A090730
Adjacent sequences: A163433 A163434 A163435 * A163437 A163438 A163439
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| David Bevan (dbevan(AT)emtex.com), Jul 28 2009
|
| |
|
|
