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

%I #4 Jan 10 2014 11:06:20

%S 2644,102376,3886120,146213244,5485253042,205551169550,7699719982722,

%T 288383414393138,10800536489561114,404495358726610494,

%U 15148844516247948642,567341751928412753520,21247593602541105806608

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

%C Column 5 of A235449

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

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 10 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 28 04:16 EDT 2024. Contains 372020 sequences. (Running on oeis4.)