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

%I #4 Jan 11 2014 13:25:29

%S 2660,103736,3977050,150092214,5645191775,211711499238,7934494535832,

%T 297222406479878,11132550506229506,416940408877849294,

%U 15615143184638270525,584807372908857047008,21901745641913166256875

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

%C Column 5 of A235517

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

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 11 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 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)