|
|
A206019
|
|
Number of (n+1) X 7 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
|
|
|
1237000, 129573608, 14856355384, 1777528400280, 216074701653640, 26463715503890184, 3251307042119435624, 400041879843666759720, 49252957039545221475992, 6065827545082816605106648
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3:
..3..2..0..0..0..0..1....0..0..1..1..1..1..2....2..2..3..0..0..1..0
..0..1..1..3..2..3..1....2..3..2..3..0..3..3....3..0..3..1..2..1..2
..3..2..0..3..0..3..0....0..3..0..3..1..1..2....1..0..2..1..3..0..2
..0..1..0..1..0..1..0....0..1..0..2..2..0..3....1..3..2..0..3..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|