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!)
A183482 Number of nX8 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors 0

%I #4 Mar 31 2012 12:35:51

%S 63,20223,270611,15984991,1577932971,56697667073

%N Number of nX8 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors

%C Column 8 of A183483

%e Some solutions for 4X8

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 05 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 23 13:41 EDT 2024. Contains 371914 sequences. (Running on oeis4.)