login
A203630
Number of n X n 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
0
2, 4, 8, 154, 58816, 8752012, 14513555724, 259726000943352, 1588377098739527452
OFFSET
1,1
COMMENTS
Diagonal of A203638
EXAMPLE
Some solutions for n=5
..1..1..1..0..0....1..1..0..1..1....1..0..0..1..1....0..1..1..0..0
..1..1..0..0..0....1..1..1..1..1....1..0..1..1..1....1..1..1..0..0
..0..1..0..0..1....0..0..0..1..1....1..1..1..1..0....1..1..1..0..1
..1..1..0..0..1....1..0..0..0..0....1..0..0..0..0....0..1..0..0..1
..1..1..0..0..1....0..0..0..0..1....0..0..0..0..0....0..0..0..0..1
CROSSREFS
Sequence in context: A200758 A110746 A084010 * A265595 A133036 A083147
KEYWORD
nonn
AUTHOR
R. H. Hardin Jan 04 2012
STATUS
approved