|
|
A186868
|
|
Number of (n+1)X3 0..2 arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums
|
|
1
|
|
|
171, 2121, 24414, 285724, 3409112, 40893800, 492154924, 5938127608, 71755699992, 868144018572, 10511898062464, 127364674658272, 1543896563706688, 18721690171445596, 227085751983499944, 2755034034648413220
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 5X3
..0..1..1....0..0..1....0..1..0....0..1..2....0..2..0....0..1..0....0..1..2
..2..1..1....1..2..1....2..2..0....1..1..2....2..2..0....1..1..1....1..2..0
..1..0..0....0..0..1....1..0..1....0..1..2....0..2..0....2..2..2....0..1..2
..0..2..0....1..2..1....0..2..0....2..2..2....0..1..0....0..2..0....2..1..2
..0..1..0....2..1..2....0..2..0....0..1..2....1..0..1....2..0..2....2..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|