|
| |
|
|
A184230
|
|
Half the number of (n+1)X9 0..3 arrays with every 2X2 subblock diagonal sum differing from its antidiagonal sum by more than 3
|
|
1
|
|
|
|
78597, 20204829, 2366228756, 402560143085, 58125919236791, 9060575120369248, 1365148390837029545, 208931377551712553029, 31752580288265710345482, 4841142511484050619724845, 737035578935913022062779089
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for 3X9
..0..2..0..2..0..2..0..1..0....0..2..0..2..0..3..0..1..0
..3..1..3..0..3..0..3..0..3....3..1..3..0..2..0..3..0..3
..0..2..0..1..0..2..0..3..1....0..2..0..3..0..3..0..3..0
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
