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

%I #4 Feb 13 2014 06:43:06

%S 1902,26230,367726,5195344,73170922,1029281994,14489762434,

%T 204068007444,2873241939356,40449727138522,569502983806472,

%U 8018543062571802,112896834642809590,1589503574124427514,22379268785330234876

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

%C Column 2 of A237791

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

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 13 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 17:29 EDT 2024. Contains 371962 sequences. (Running on oeis4.)