A203593 Number of n X n 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other

3, 16, 172, 20000, 8227090

Offset

1,1

Comments

Diagonal of A203600

Links

Table of n, a(n) for n=1..5.

Example

Some solutions for n=4
..2..1..0..2....1..0..2..0....1..0..0..2....1..2..2..0....0..0..1..1
..0..0..2..2....0..0..1..0....1..0..1..2....0..2..2..0....0..1..2..0
..0..0..1..2....0..2..2..1....0..0..2..1....0..1..0..0....0..2..2..0
..1..0..2..2....0..2..2..2....0..2..2..2....2..2..1..0....1..2..2..0

Crossrefs

Sequence in context: A277458 A172402 A297668 * A304902 A024041 A152554

Adjacent sequences: A203590 A203591 A203592 * A203594 A203595 A203596

Keyword

nonn

Author

R. H. Hardin Jan 03 2012

Status

approved