The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 0
 3, 16, 172, 20000, 8227090 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A203600 LINKS 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 1 05:25 EDT 2023. Contains 361673 sequences. (Running on oeis4.)