|
|
A269337
|
|
Number of 3Xn arrays containing n copies of 0..3-1 avoiding the pattern equal-up in every row and column.
|
|
1
|
|
|
6, 74, 852, 10210, 124466, 1539739, 19271229, 243392830, 3095718114, 39591108117, 508549674595, 6555349397662, 84743875128342, 1098136390356477, 14258478535216226, 185450173389172712, 2415532450075364094
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..2..2. .1..2..1..2. .2..2..2..1. .1..0..2..0. .1..1..0..1
..2..1..2..0. .0..2..1..1. .1..2..1..1. .0..2..1..2. .0..2..2..2
..1..1..0..0. .2..0..0..0. .0..0..0..0. .1..2..0..1. .0..1..2..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|