The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A235667 Number of (3+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

%S 33610,3377510,314516602,25757334784,1985139761308,143468661921620,

%T 9943144779735306,663721389380552504,43067478348737689590,

%U 2728158285998906700578,169524380931449477078492

%N Number of (3+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 3 of A235665

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

%e Some solutions for n=1

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

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

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

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

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 5 16:53 EDT 2020. Contains 333245 sequences. (Running on oeis4.)