|
|
A206086
|
|
Number of (n+1) X (n+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
|
|
1
|
|
|
81, 780, 4560, 48816, 516912, 10584000, 408445632, 17222950080, 1397673066240, 214644729219840, 36193471662355200, 11735368648637414400, 7204350072147674803200, 4859051673972177459072000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4:
..1..0..2..1..1....2..0..1..0..0....1..2..2..1..0....2..0..2..2..0
..1..0..0..2..1....2..0..0..2..0....0..1..2..2..1....2..2..0..2..2
..0..2..0..0..2....0..2..0..0..1....0..0..1..2..2....1..2..2..0..2
..0..0..2..0..0....0..0..1..0..0....2..0..0..1..2....0..1..2..2..0
..1..0..0..2..2....1..0..0..1..1....0..1..0..0..1....0..0..1..2..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|