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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A238051 Number of (n+1)X(3+1) 0..3 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1

%I

%S 12352,249664,5166560,107643264,2246142916,46940148128,978607916368,

%T 20366342381968,425018025343492,8883521543001864,185210728399683652,

%U 3854629980225887640,80442685685640839192,1681395591128610885784

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

%C Column 3 of A238054

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

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 17 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 November 28 00:05 EST 2022. Contains 358406 sequences. (Running on oeis4.)