|
| |
|
|
A188368
|
|
Number of (n+1)X3 0..3 arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums
|
|
1
|
|
|
|
704, 15776, 315520, 6781400, 146491208, 3204417424, 70324529528, 1550290704312, 34247741174176, 758246919492968, 16810324686733992, 373161215486655440, 8291015786317391720, 184361263940488110328, 4102028210533831306896
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for 4X3
..2..0..1....2..0..1....0..0..0....0..0..0....0..3..0....2..2..2....2..1..2
..2..1..3....0..0..2....1..1..1....0..1..0....0..2..0....3..2..3....2..3..0
..0..3..0....1..1..0....2..0..0....2..2..2....2..3..0....1..2..1....3..0..3
..1..2..2....0..0..2....1..1..3....2..2..2....0..2..2....1..0..1....3..0..3
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
