|
|
A183846
|
|
Number of (n+1)X(n+1) 0..3 arrays with each element of every 2X2 subblock being the sum mod 4 of two others
|
|
0
|
|
|
35, 429, 9557, 448665, 40482339, 9808052813, 5102345174752, 6963325147796767, 21046774704680367392, 146145472233705207996377, 2243552020457712284374333510
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 3X3
..2..3..2....2..1..2....2..2..2....1..2..3....1..3..1....0..2..2....0..0..0
..3..1..3....1..3..3....0..0..2....3..1..1....1..2..3....0..2..0....2..2..2
..3..2..1....3..2..1....0..0..2....3..2..3....1..3..1....0..2..0....0..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|