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

 

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

%I

%S 11960,221512,4248736,82919944,1621147104,31641923080,616331002428,

%T 12011356925024,234603565050504,4580128895980528,89230824433658628,

%U 1738941638634259312,33963912422435796628,663075442863151557160

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

%C Column 3 of A237494

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

%e Some solutions for n=1

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

%e ..2..3..3..2....3..1..3..2....3..3..0..2....1..1..3..2....2..0..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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 16 12:15 EDT 2022. Contains 356168 sequences. (Running on oeis4.)