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!)
A236974 Number of (n+1)X(2+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:49:27

%S 1238,9854,76212,635960,5259146,44597946,376887360,3222991866,

%T 27520095568,236568864708,2032537681056,17535842104346,

%U 151294565594066,1308890744507700,11327010592855074,98206225621215244,851830423648769622

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

%C Column 2 of A236979

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

%e Some solutions for n=3

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

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

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

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

%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 23:15 EDT 2024. Contains 371798 sequences. (Running on oeis4.)