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

%I #7 Aug 08 2023 14:16:21

%S 10262,237650,5422402,125103786,2885253967,66555378453,1535446610156,

%T 35423389400148,817231843461740,18853921505477183,434968805589706807,

%U 10034934369985494192,231510653332437370574,5341059614442076742761

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

%C Column 3 of A187317.

%H R. H. Hardin, <a href="/A187311/b187311.txt">Table of n, a(n) for n = 1..200</a>

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

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

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

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

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

%Y Cf. A187317.

%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 April 25 11:29 EDT 2024. Contains 371967 sequences. (Running on oeis4.)