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!)
A186793 Half the number of (n+2)X8 binary arrays with each 3X3 subblock having a sum in 2..7 1

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

%S 6932452,1541462868,341441530745,75702797880635,16782289067411968,

%T 3720538199779806652,824819184923132441809,182857140437300684443157,

%U 40538257169883455074808457,8987072257793266411309168370

%N Half the number of (n+2)X8 binary arrays with each 3X3 subblock having a sum in 2..7

%C Column 6 of A186796

%H R. H. Hardin, <a href="/A186793/b186793.txt">Table of n, a(n) for n = 1..60</a>

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 26 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 March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)