|
|
A267333
|
|
Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 4 and the upper left element equal to 0.
|
|
1
|
|
|
6, 0, 0, 1, 22, 396, 2516, 10533, 33704, 92526, 369726, 2640466, 20643782, 138985920, 774999596, 3688265633, 16042197634, 71499663298, 364035498690, 2117882102632, 12817951753070, 74510126235424, 404088344721210, 2063669373837938
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=6
..0..1..2..2..3..3....0..1..2..3..0..0....0..1..2..2..3..0....0..0..0..1..2..3
..0..1..1..2..3..0....0..1..2..3..3..0....1..1..2..3..3..0....3..0..1..1..2..3
..0..1..2..2..3..0....1..1..2..2..3..0....0..1..2..3..3..0....3..0..1..1..2..2
..1..1..2..3..3..0....1..1..2..2..3..3....1..1..2..2..3..0....3..0..1..2..2..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|