|
|
A183581
|
|
Half the number of nX6 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors
|
|
1
|
|
|
38, 12024, 1282814, 149355515, 17195908538, 1988200387149, 229716738097391, 26548571098836075, 3068082753691026342, 354569738678873849813, 40976532204608285387767, 4735538672860090875422373
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions with a(1,1)<=1 for 3X6
..0..0..2..2..1..3....0..0..0..3..3..3....0..0..1..0..0..0....0..0..2..2..3..1
..0..1..1..1..1..3....0..2..0..3..3..2....0..1..1..1..0..0....0..0..0..3..3..1
..1..1..1..2..2..2....0..2..2..2..3..2....1..1..1..1..1..1....0..0..2..2..3..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|