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!)
A235668 Number of (4+1)X(n+1) 0..3 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise 1

%I #4 Jan 13 2014 07:50:59

%S 344668,97225212,25779181084,6040295484562,1339343216343068,

%T 277976281746083226,55242119924026366582,10527964717485738011446,

%U 1940853801717929483432702,347172878236877263764212860

%N Number of (4+1)X(n+1) 0..3 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise

%C Row 4 of A235665

%H R. H. Hardin, <a href="/A235668/b235668.txt">Table of n, a(n) for n = 1..24</a>

%e Some solutions for n=1

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 13 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 24 02:45 EDT 2024. Contains 371917 sequences. (Running on oeis4.)