|
|
A206664
|
|
Number of (n+1) X 5 0..2 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors.
|
|
1
|
|
|
12477, 119727, 1637151, 25229685, 404408697, 6593653335, 108688211619, 1799150533260, 29878961439630, 496855658151597, 8271315187974831, 137759633224044003, 2295322855995816864, 38251083002490384138
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4:
..1..0..2..1..0....1..2..1..0..1....1..2..1..2..1....2..1..2..2..2
..1..0..2..0..1....1..2..1..1..1....1..0..1..0..0....2..2..2..1..1
..0..0..1..2..0....1..1..1..2..1....1..2..1..2..1....1..1..1..1..2
..1..2..0..1..1....0..0..1..2..1....0..0..0..2..0....0..1..2..2..2
..2..1..2..1..0....0..1..1..2..2....1..2..1..2..1....0..1..2..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|