|
|
A206020
|
|
Number of (n+1) X 8 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
|
|
|
8079000, 1477339224, 302535915752, 65511284596104, 14510530142894840, 3251307042119435624, 732416961112609324840, 165443189675086011015528, 37421249748394203065104568, 8469999436280795373419180280
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3:
..0..3..0..2..0..3..1..1....3..2..3..0..0..3..0..3....1..1..1..0..3..2..3..3
..2..2..0..1..0..2..2..3....3..0..3..2..1..1..1..1....0..2..3..0..1..1..0..2
..3..1..0..2..0..3..0..0....3..1..3..0..0..2..0..2....0..1..3..2..2..3..3..2
..2..2..3..2..1..1..1..2....3..0..3..1..3..2..1..1....2..1..0..1..0..0..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|