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!)
A237295 Number of (n+1) X (3+1) 0..3 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2 X 2 subblock equal. 1

%I #6 Dec 31 2023 15:45:38

%S 5360,56752,685244,9292680,134597244,2051387740,32420171928,

%T 527547020504,8787002245648,149199162038628,2573271092024688,

%U 44949130957009720,793203709353702320,14111627418400298736,252674070132372363880

%N Number of (n+1) X (3+1) 0..3 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2 X 2 subblock equal.

%C Column 3 of A237299.

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

%e Some solutions for n=2

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

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

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

%Y Cf. A237299.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 06 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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)