login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of nX8 0..2 arrays with each element equal to either the sum mod 3 of its horizontal and vertical neighbors or the sum mod 3 of its diagonal and antidiagonal neighbors
0

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

%S 63,8673,215451,11678037,728459961

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

%C Column 8 of A183526

%e Some solutions for 3X8

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 05 2011