|
|
A184609
|
|
Half the number of (n+1)X5 binary arrays with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one
|
|
1
|
|
|
350, 5430, 84828, 1396000, 22837236, 371916790, 6057271712, 98736408638, 1609249499406, 26226651558476, 427426869260636, 6966059653561716, 113530198300555118, 1850270720091619100, 30154985100111173212
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 3X5
..1..0..0..1..0....0..1..0..1..1....0..1..1..0..1....1..1..0..0..0
..0..0..1..0..0....0..0..0..0..0....1..1..0..1..1....0..0..1..1..1
..1..1..0..1..1....1..1..1..1..0....1..1..1..1..1....1..1..0..0..1
...
...1..1..2..1.......1..1..1..2.......3..3..2..3.......2..2..2..2...
...2..2..2..2.......2..2..2..1.......4..3..3..4.......2..2..2..3...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|