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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A235672 Number of (n+1)X(n+1) 0..1 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise 0

%I

%S 16,380,28584,6894210,5376199876,13578805464958,111141360154581108,

%T 2948319928633417670416,253497281472306754538416318,

%U 70644048705639953560633398930712

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

%C Diagonal of A235679

%e Some solutions for n=3

%e ..1..1..0..1....1..0..0..1....0..0..1..0....0..0..0..1....0..1..1..0

%e ..0..0..0..0....0..0..1..1....1..0..1..0....1..0..1..0....0..0..1..0

%e ..1..0..1..0....1..0..1..0....1..0..0..0....1..1..0..1....0..1..0..1

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 28 07:43 EDT 2021. Contains 348321 sequences. (Running on oeis4.)