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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A237506 Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1

%I

%S 1342,9108,62031,462206,3489965,25188644,180995914,1323886040,

%T 9750862216,70896853212,515780878618,3760128852508,27527933916550,

%U 200444657289112,1462699965537270,10656195549646172,77892908821912858,567346977263750148

%N Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one

%C Column 3 of A237511

%H R. H. Hardin, <a href="/A237506/b237506.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=3

%e ..0..0..1..1....0..1..1..2....0..1..1..0....0..1..0..2....1..1..2..2

%e ..2..2..0..1....2..0..1..0....1..0..2..2....0..1..2..1....0..1..0..1

%e ..1..2..1..2....2..1..2..2....0..2..1..1....0..2..0..0....1..2..2..0

%e ..1..1..0..2....0..1..1..1....2..0..1..2....0..0..1..1....1..1..2..1

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 08 2014

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 March 24 11:39 EDT 2023. Contains 361479 sequences. (Running on oeis4.)