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!)
A187314 Half the number of (n+2)X8 binary arrays with each 3X3 subblock having sum 3, 4, 5 or 6 1

%I #5 Mar 31 2012 12:36:08

%S 3516295,491649803,66555378453,9206325629324,1272968321737346,

%T 176072290483114471,24360553147588517588,3370511547179611607654,

%U 466342029228106604821988,64523343089040070530245388

%N Half the number of (n+2)X8 binary arrays with each 3X3 subblock having sum 3, 4, 5 or 6

%C Column 6 of A187317

%H R. H. Hardin, <a href="/A187314/b187314.txt">Table of n, a(n) for n = 1..16</a>

%e Some solutions for 4X8 with a(1,1)=0

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 08 2011

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 July 18 00:08 EDT 2024. Contains 374377 sequences. (Running on oeis4.)