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!)
 A238073 Number of (n+1)X(n+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 0
 256, 14456, 1781008, 336372000, 182752988334, 220851136586828, 747061315866664736, 5370193055761518144212 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A238081 LINKS EXAMPLE Some solutions for n=2 ..2..3..2....3..2..0....3..0..2....2..2..0....1..1..1....0..3..3....1..2..3 ..1..3..2....1..0..1....2..1..2....0..2..3....3..2..1....2..1..3....2..3..3 ..0..1..1....1..2..3....3..1..1....1..3..1....0..3..3....2..3..0....3..2..1 CROSSREFS Sequence in context: A205089 A239443 A240932 * A017032 A136286 A269204 Adjacent sequences:  A238070 A238071 A238072 * A238074 A238075 A238076 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 April 7 09:31 EDT 2020. Contains 333300 sequences. (Running on oeis4.)