|
|
A206018
|
|
Number of (n+1) X 6 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.
|
|
1
|
|
|
189400, 11364568, 729589784, 48253100168, 3222294559864, 216074701653640, 14510530142894840, 975067532289817432, 65537137892387004824, 4405376894671163369304, 296138641779024025159784
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3:
..1..1..0..2..1..3....3..1..3..2..2..1....3..3..2..3..0..0....3..3..3..2..1..3
..3..2..3..2..0..3....2..2..3..0..3..1....1..0..2..1..1..2....1..0..1..2..0..3
..0..0..3..1..0..1....0..1..3..2..2..1....1..3..3..3..0..0....1..2..1..3..0..1
..1..2..2..1..2..1....2..2..3..0..3..3....0..0..2..1..1..3....3..2..0..3..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|