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!)
A237085 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 2X2 subblock equal 1

%I #4 Feb 03 2014 05:45:31

%S 3274,17636,96104,578486,3497586,22239606,141915177,938113698,

%T 6226900258,42501875752,291504044435,2045212080058,14422851346945,

%U 103578289234633,747463538074593,5471028802930662,40213861941280150,298769793896148614

%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 2X2 subblock equal

%C Column 3 of A237090

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

%e Some solutions for n=3

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

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

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

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

%K nonn

%O 1,1

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