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

%I #4 Feb 02 2014 06:50:00

%S 6024,76212,898820,11850502,151656752,2025835812,26630922346,

%T 357532653542,4755836009162,64003985025026,856771671964444,

%U 11547914807203730,155175900645701946,2093923309757087606

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

%C Column 3 of A236979

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

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 02 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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)