The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227678 Number of nX5 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X6 binary array having an odd sum, with rows and columns of the latter in lexicographically nondecreasing order 1

%I #5 Aug 11 2014 22:45:53

%S 16,301,5434,90884,1330361,16795263,184000783,1773503344,15261176700,

%T 118793987740,845798776106,5559078678951,33988369766356,

%U 194559879927981,1048491460707150,5344823772801721,25880047053192859,119467909882082282

%N Number of nX5 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X6 binary array having an odd sum, with rows and columns of the latter in lexicographically nondecreasing order

%C Column 5 of A227679

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

%H R. H. Hardin, <a href="/A227678/a227678.txt">Empirical polynomial of degree 62</a>

%F Empirical polynomial of degree 62 (see link above)

%e Some solutions for n=4

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jul 19 2013

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.

Last modified December 9 02:18 EST 2023. Contains 367681 sequences. (Running on oeis4.)