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!)
A237958 Number of (n+1)X(1+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

%S 81,340,1422,6042,25777,109200,462852,1962464,8337456,35340888,

%T 150013756,635934272,2700293296,11446693312,48598395488,206013123488,

%U 874700630800,3707927149312,15742965653824,66735768122368,283346471210496

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

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

%F Empirical: a(n) = 216*a(n-4) +1692*a(n-6) +4288*a(n-8) +3968*a(n-10) +1024*a(n-12)

%e Some solutions for n=5

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

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

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

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

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

%e ..2..1....2..1....1..1....0..1....2..1....2..0....0..0....1..0....1..1....2..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 August 9 07:42 EDT 2022. Contains 356019 sequences. (Running on oeis4.)