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

 


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

%I #9 Jan 24 2023 15:27:49

%S 58088,1200450,25159676,555327358,12223260408,269190640070,

%T 5926795463268,130935771115948,2892237697738592,63737875779963536,

%U 1404420202515168812,31026875531399678894,685474376516107698200,15106769376158639394482

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

%C Column 4 of A237403.

%H R. H. Hardin, <a href="/A237402/b237402.txt">Table of n, a(n) for n = 1..39</a>

%e Some solutions for n=1

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

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

%Y Cf. A237403.

%K nonn

%O 1,1

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