The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A238064 Number of (n+1)X(n+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 0
 256, 16116, 2296588, 506608980, 323819924384, 448255641499780, 1736639229342029538, 13883769406039825746192 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A238072 LINKS EXAMPLE Some solutions for n=2 ..1..3..0....3..3..0....3..0..0....2..3..1....3..1..3....2..1..1....2..1..3 ..3..1..1....1..1..2....0..1..2....1..2..0....0..2..2....3..2..1....2..1..3 ..0..2..3....1..2..3....2..1..1....2..2..1....2..1..1....3..2..3....0..0..3 CROSSREFS Sequence in context: A269204 A224283 A224206 * A176764 A235964 A206319 Adjacent sequences:  A238061 A238062 A238063 * A238065 A238066 A238067 KEYWORD nonn AUTHOR R. H. Hardin, Feb 17 2014 STATUS approved

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

Last modified July 28 17:15 EDT 2021. Contains 346335 sequences. (Running on oeis4.)