|
|
A253161
|
|
Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally
|
|
1
|
|
|
3844, 46752, 555842, 7252320, 92998506, 1190692584, 15179218714, 194198939906, 2482220834294, 31740256495626, 405683545431502, 5186473593590730, 66301707444606534, 847604837440730462, 10835407210226372002
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=2
..0..1..0..1....1..2..1..2....1..1..1..2....1..1..1..0....2..1..2..2
..2..0..0..1....2..0..1..2....0..0..1..2....2..0..0..2....0..1..1..2
..2..1..1..1....2..0..0..0....2..1..2..0....2..1..2..1....0..1..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|