|
|
A221277
|
|
Number of 3Xn arrays of occupancy after each element moves to some horizontal, diagonal or antidiagonal neighbor, with every occupancy equal to zero or two
|
|
0
|
|
|
0, 0, 0, 100, 0, 0, 0, 46656, 0, 0, 0, 27836176, 0, 0, 0, 17029206016, 0, 0, 0, 10443393677376, 0, 0, 0, 6406089127650304, 0, 0, 0, 3929655953461248256, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..2..2..0....0..2..0..0....0..2..2..0....0..2..2..0....2..0..2..0
..0..2..0..0....0..2..2..2....0..2..2..0....0..2..2..2....0..2..2..0
..2..0..2..2....2..0..2..0....2..0..0..2....2..0..0..0....0..2..0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|