|
|
A183602
|
|
1/6 the number of (n+1)X9 0..2 arrays with every 2X2 subblock containing all three values
|
|
1
|
|
|
209304, 30539367, 3823553752, 495215814566, 63854542807704, 8251614370134644, 1066653925785997106, 137936054886331468840, 17840841964756696807680, 2307848389145766144487866, 298559730522953008074518020
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions with a(1,1)=0 for 3X9
..0..0..0..0..0..1..1..1..0....0..0..0..0..0..0..0..2..0
..1..2..1..2..1..2..0..2..1....1..2..1..2..1..2..1..1..2
..2..0..0..0..0..0..1..2..0....0..2..0..0..1..0..2..0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|