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!)
A237961 Number of (n+1)X(4+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:05

%S 6042,64146,645156,7259122,84562206,940160466,10256817488,

%T 114442690994,1289184763590,14363355184818,159182824702650,

%U 1774324207171920,19835441920244388,221078397238990622,2459909992151774668

%N Number of (n+1)X(4+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 4 of A237965

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

%e Some solutions for n=2

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

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

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

%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 14:32 EDT 2024. Contains 371960 sequences. (Running on oeis4.)