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

 


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

%I #4 Feb 05 2014 05:47:54

%S 928,3284,12014,29456,97862,269844,926086,2450048,8256930,22301740,

%T 75579798,202641416,684983946,1842571444,6234175914,16748300216,

%U 56643845034,152257571812,515024932506,1384075694696,4681456782942

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

%C Column 3 of A237234

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

%F Empirical: a(n) = 5*a(n-2) +42*a(n-4) -21*a(n-6) -207*a(n-8) for n>13

%e Some solutions for n=5

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

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 05 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 23 18:10 EDT 2024. Contains 376182 sequences. (Running on oeis4.)