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!)
A237401 Number of (n+1) X (3+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 #7 Feb 07 2014 19:27:17

%S 9296,126848,1748190,25159676,361453184,5197555932,74749364118,

%T 1077627856648,15531402661308,223495979069900,3216439008082184,

%U 46370877351516392,668414586969745184,9618695801956763148

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

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

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

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