|
|
A184229
|
|
Half the number of (n+1)X8 0..3 arrays with every 2X2 subblock diagonal sum differing from its antidiagonal sum by more than 3
|
|
1
|
|
|
23355, 3302001, 231988508, 22718557269, 1922921988456, 174220807520698, 15315046904131217, 1365148390837029545, 120929646236147243376, 10742955468995988996920, 953140018069343327537272
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 3X8
..0..2..0..1..0..2..0..3....0..2..0..2..0..2..1..3....0..2..0..2..0..3..0..1
..3..0..3..0..3..0..3..2....2..0..3..0..3..0..3..0....2..0..3..0..2..0..3..0
..1..2..0..3..0..1..0..3....1..3..2..3..1..2..1..2....0..2..0..3..0..3..1..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|