|
|
A206143
|
|
Number of (n+1) X 2 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.
|
|
1
|
|
|
81, 60, 162, 486, 1458, 4374, 13122, 39366, 118098, 354294, 1062882, 3188646, 9565938, 28697814, 86093442, 258280326, 774840978, 2324522934, 6973568802, 20920706406, 62762119218, 188286357654, 564859072962, 1694577218886
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 3*a(n-1) for n > 3.
|
|
EXAMPLE
|
Some solutions for n=4:
..1..2....0..2....2..1....2..1....2..0....1..2....2..1....1..2....0..2....1..2
..0..1....1..0....0..2....0..2....0..1....2..0....0..2....2..1....1..0....2..0
..1..0....2..1....2..0....1..0....2..0....0..1....1..0....0..2....2..1....1..2
..0..2....0..2....1..2....2..1....0..2....2..0....2..1....1..0....1..0....0..1
..2..0....2..1....2..0....1..2....1..0....1..2....1..0....2..1....0..1....1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|