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!)
A237962 Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1

%I #4 Feb 16 2014 06:39:47

%S 25777,378532,5242451,84562206,1421887147,22274482472,341724039082,

%T 5408347744632,87004865397990,1370936608541092,21499410611130068,

%U 339342193069725084,5397303391859224140,85141464745920483696

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

%C Column 5 of A237965

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

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 16 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 April 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)